Introduction to Linear Optimization
Introduction to Linear Optimization
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Core Problems in Knapsack Algorithms
Operations Research
Core problems in bi-criteria {0,1}-knapsack problems
Computers and Operations Research
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
The core concept for the multidimensional knapsack problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Code-size conscious pipelining of imperfectly nested loops
MEDEA '07 Proceedings of the 2007 workshop on MEmory performance: DEaling with Applications, systems and architecture
Software Pipelining in Nested Loops with Prolog-Epilog Merging
HiPEAC '09 Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers
Local branching-based algorithms for the disjunctively constrained knapsack problem
Computers and Industrial Engineering
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Computers and Operations Research
Improved LP-based algorithms for the closest string problem
Computers and Operations Research
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
INFORMS Journal on Computing
MOWS: macro and micro online webview selection
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
The Express heuristic for probabilistically constrained integer problems
Journal of Heuristics
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
We study the multidimensional knapsack problem, present some theoretical and empirical results about its structure, and evaluate different integer linear programming (ILP)-based, metaheuristic, and collaborative approaches for it. We start by considering the distances between optimal solutions to the LP relaxation and the original problem and then introduce a new core concept for the multidimensional knapsack problem (MKP), which we study extensively. The empirical analysis is then used to develop new concepts for solving the MKP using ILP-based and memetic algorithms. Different collaborative combinations of the presented methods are discussed and evaluated. Further computational experiments with longer run times are also performed to compare the solutions of our approaches to the best-known solutions of another so-far leading approach for common MKP benchmark instances. The extensive computational experiments show the effectiveness of the proposed methods, which yield highly competitive results in significantly shorter run times than do previously described approaches.