An Improved Heuristic for Multidimensional 0-1 Knapsack Problems

DOI10.1057/JORS.1990.148zbMath0724.90044OpenAlexW1986351702MaRDI QIDQ5202507

A. Volgenant, J. A. Zoon

Publication date: 1990

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.148

zbMATH Keywords

Lagrange multipliersupper boundheuristicmultidimensional 0-1 knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

A RNN-based hyper-heuristic for combinatorial problems ⋮ A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles ⋮ Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem ⋮ Greedy algorithm for the general multidimensional knapsack problem ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

This page was built for publication: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems