A new algorithm for the 0-1 knapsack problem
Management Science
Introduction to Linear Optimization
Introduction to Linear Optimization
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The core concept for the multidimensional knapsack problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative profits, weights and capacities. The core concept provides opportunities for heuristically solving the MKP, achieving higher quality solutions and shorter runtimes than general IP methods. We provide the theoretical foundations of the extended core concept and further provide computational experiments showing that we can achieve similar computational behavior for extended MKP instances with negative weights, profits and capacities.