S Laabadi, M Naimi, H El Amri, B Achchab - American Journal of …, 2018 - scirp.org
The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in …
Y Chen, JK Hao - European Journal of Operational Research, 2014 - Elsevier
The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper …
R Islam, MS Rahman - 2012 International Conference on …, 2012 - ieeexplore.ieee.org
In this paper we consider a real life waste collection problem that can be seen as a variant of the vehicle routing problem with time windows. In this problem there is a set of clients to be …
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem …
A Mkaouar, S Htiouech… - 2020 IEEE Congress on …, 2020 - ieeexplore.ieee.org
The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an NP-hard problem. Many heuristics algorithms have been developed to solve this combinatorial optimization …
S Kumari, N Kumar, PS Rana - Electronics, 2022 - mdpi.com
Smart Grids (SG) generate extensive data sets regarding the system variables, viz., and demand and supply. These extremely large data sets are known as big data. Hence …
S Voß, E Lalla-Ruiz - Engineering Optimization, 2016 - Taylor & Francis
The Multiple-choice Multidimensional Knapsack Problem (MMKP) is a well-known-hard combinatorial optimization problem that has received a lot of attention from the research …
Cloud-Radio Access Network (C-RAN) is an attractive solution to Mobile Network Operators. Firstly, C-RAN leverages the effect of pooling multiple Baseband Units (BBUs) to offer …
One of the essential and well-known classes of combinatorial optimization problems commonly studies by researchers in the last five decades is called the Knapsack Problem …