On The Strength Of Relaxations Of Multidimensional Knapsack Problems
From MaRDI portal
Publication:4834073
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
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
- scientific article; zbMATH DE number 4191398 (Why is no real title available?)
- 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)
