On The Strength Of Relaxations Of Multidimensional Knapsack Problems

DOI10.1080/03155986.1994.11732252zbMath0823.90093OpenAlexW2399250890MaRDI QIDQ4834073

Joseph B. Mazzola, Yves Cramer

Publication date: 25 October 1995

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732252

zbMATH Keywords

Lagrangian relaxationbranch-and-boundsurrogate relaxationmultidimensional knapsack problemscomposite relaxation

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem ⋮ A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: On The Strength Of Relaxations Of Multidimensional Knapsack Problems