A k-means binarization framework applied to multidimensional knapsack problem
Sign Up to like & getrecommendations! Published in 2017 at "Applied Intelligence"
DOI: 10.1007/s10489-017-0972-6
Abstract: The multidimensional knapsack problem (MKP) is one of the widely known integer programming problems. The MKP has received significant attention from the operational research community for its large number of applications. Solving this NP-hard problem… read more here.
Keywords: knapsack problem; framework; means binarization; problem ... See more keywords
Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Access"
DOI: 10.1109/access.2023.3264966
Abstract: The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard problem that has many real-time applications. However, owing to its complexity, finding computationally efficient solutions for the MMKP remains a challenging task. In this study,… read more here.
Keywords: problem; multidimensional knapsack; modified artificial; choice multidimensional ... See more keywords
A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem
Sign Up to like & getrecommendations! Published in 2020 at "Mathematics"
DOI: 10.3390/math8040507
Abstract: This article proposes a hybrid algorithm that makes use of the db-scan unsupervised learning technique to obtain binary versions of continuous swarm intelligence algorithms. These binary versions are then applied to large instances of the… read more here.
Keywords: knapsack problem; hybrid algorithm; multidimensional knapsack;