On The Strength Of Relaxations Of Multidimensional Knapsack Problems
From MaRDI portal
Publication:4834073
DOI10.1080/03155986.1994.11732252zbMATH Open0823.90093OpenAlexW2399250890MaRDI QIDQ4834073FDOQ4834073
Authors: Joseph B. Mazzola, Yves Crama 
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
Recommendations
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Heuristics for the 0-1 multidimensional knapsack problem
- Zero-one integer programs with few contraints - lower bounding theory
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
- Publication:3471851
branch-and-boundLagrangian relaxationsurrogate relaxationmultidimensional knapsack problemscomposite relaxation
Cited In (10)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- A concise characterization of strong knapsack facets
- Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
- Title not available (Why is that?)
- Zero-one integer programs with few contraints - lower bounding theory
- 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
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
This page was built for publication: On The Strength Of Relaxations Of Multidimensional Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834073)
