On separating cover inequalities for the multidimensional knapsack problem

DOI10.1016/j.cor.2005.05.032zbMath1159.90460OpenAlexW2139189498MaRDI QIDQ858283

Osman Oguz, Tolga Bektaş

Publication date: 9 January 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/11441

zbMATH Keywords

integer programmingcover inequalitiesseparation problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (5)

Knapsack polytopes: a survey ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Separation algorithms for 0-1 knapsack polytopes ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Solving Large-Scale Zero-One Linear Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

This page was built for publication: On separating cover inequalities for the multidimensional knapsack problem