Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

Operations Research Letters

Volumn 30, Issue 2, 2002, Pages 74-82

  Letchford, Adam N ^a   Lodi, Andrea ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Cutting planes; Integer programming; Valid inequalities

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; LINEAR PROGRAMMING; PROBLEM SOLVING;

GOMORY FRACTIONAL CUTS;

INTEGER PROGRAMMING;

EID: 0036543735     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00112-8     Document Type: Article

References (16)

1. Polyhedral combinatorics
2. Disjunctive programming
3. A strengthening procedure for mixed-integer programs
4. A lift-and-project cutting plane algorithm for mixed 0-1 programs
5. A subadditive approach to solve linear integer programs
6. On the separation of maximally violated mod-k cuts
7. Edmonds polytopes and a hierarchy of combinatorial problems
8. Elementary closures for integer programs
9. On the membership problem for the elementary closure of a polyhedron
10. Outline of an algorithm for integer solutions to linear programs
11. Some continuous functions related to corner polyhedra I
12. Some continuous functions related to corner polyhedra II
13. On the Chvátal rank of certain inequalities
14. Cones of matrices and set-functions and 0-1 optimization