Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
From MaRDI portal
Publication:976440
DOI10.1016/j.ejor.2010.01.006zbMath1188.90173OpenAlexW2137740214MaRDI QIDQ976440
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.006
Uses Software
Cites Work
- Unnamed Item
- Outline of an algorithm for integer solutions to linear programs
- 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
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A Class of Hard Small 0-1 Programs
- Solving Multiple Knapsack Problems by Cutting Planes