Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
From MaRDI portal
Publication:1328648
DOI10.1016/0377-2217(94)90250-XzbMath0805.90079MaRDI QIDQ1328648
Brenda L. Dietrich, Laureano Fernando Escudero Bueno
Publication date: 26 July 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (3)
Some of my favorite integer programming applications at IBM ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ On surrogating 0-1 knapsack constraints
Cites Work
- Unnamed Item
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Efficient reformulation for 0-1 programs -- methods and computational results
- Edmonds polytopes and a hierarchy of combinatorial problems
- Outline of an algorithm for integer solutions to linear programs
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
This page was built for publication: Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
