On the membership problem for the elementary closure of a polyhedron

Combinatorica

Volumn 19, Issue 2, 1999, Pages 297-300

  Eisenbrand, Friedrich ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039522018     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050057     Document Type: Article

References (5)

1. A. CAPRARA and M. FISCHETTI: {0, 1/2}-Chvátal-Gomory cuts, Mathematical Programming, 74 (1996), 221-235.
2. W. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, and A. SCHRIJVER: Combinatorial Optimization, John Wiley, 1998.
3. M. R. GAREY and D. S. JOHNSON: Computers and Intractability. A Guide to the Theory of NP-Completeness, Freemann, 1979.
4. M. GRÖTSCHEL, L. LOVÁSZ, and A. SCHRIJVER: Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics, Springer, 1988.
5. A. SCHRIJVER: Theory of Linear and Integer Programming, John Wiley, 1986.