Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
Computational Optimization and Applications
Hard multidimensional multiple choice knapsack problems, an empirical study
Computers and Operations Research
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problems
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Local branching-based algorithms for the disjunctively constrained knapsack problem
Computers and Industrial Engineering
Computers and Operations Research
Information Sciences: an International Journal
Computers and Operations Research
A decomposition-based approach for service composition with global QoS guarantees
Information Sciences: an International Journal
First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
International Journal of Metaheuristics
A fast and scalable multidimensional multiple-choice knapsack heuristic
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
| Hi-index | 0.00 |
In this paper, we propose to solve large-scale multiple-choice multi-dimensional knapsack problems. We investigate the use of the column generation and effective solution procedures. The method is in the spirit of well-known local search metaheuristics, in which the search process is composed of two complementary stages: (i) a rounding solution stage and (ii) a restricted exact solution procedure. The method is analyzed computationally on a set of problem instances of the literature and compared to the results reached by both Cplex solver and a recent reactive local search. For these instances, most of which cannot be solved to proven optimality in a reasonable runtime, the proposed method improves 21 out of 27.