The intersection of knapsack polyhedra and extensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 243-256

  Martin, Alexander ^a   Weismantel, Robert ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GEOMETRY; MATRIX ALGEBRA;

ASSOCIATED MATRICES; COLUMN VECTOR; CUTTING PLANES; INTEGER PROGRAMMING PROBLEMS; MIXED INTEGER PROGRAMMING; STABLE SETS;

INTEGER PROGRAMMING;

EID: 84958760311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_19     Document Type: Conference Paper

References (13)

1. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0 − 1 programs. Mathematical Programming, 58:295-324, 1993
2. R. E. Bixby, S. Ceria, C. M. McZeal, and M. W. P. Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0 1998. Paper and problems available at http://www.caam.rice.edu/_bixby/miplib/miplib.html
3. S. Ceria, C. Cordier, H. Marchand, and L. A. Wolsey. Cutting planes for integer programs with general integer variables. Technical Report CORE DP9575, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1997
4. V. Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Dis- crete Mathematics, 4:305-337, 1973
5. H. Crowder, E. Johnson, and M. W. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31:803-834, 1983
6. R. E. Gomory. Solving linear programming problems in integers. In R. Bellman and M. Hall, editors, Combinatorial analysis, Proceedings of Symposia in Applied Mathematics, Vol 10. Providence, RI, 1960
7. H. Marchand and L. A. Wolsey. The 0-1 knapsack problem with a single continuous variable. Technical Report CORE DP9720, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1997
8. M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199-215, 1973
9. M. W. Padberg. A note on zero-one programming. Operations Research, 23:833-837, 1975
10. M. W. Padberg. (1; k)-configurations and facets for packing problems. Mathematical Programming, 18:94-99, 1980
11. M. W. Padberg, T. J. Van Roy, and L. A. Wolsey. Valid inequalities for fixed charge problems. Operations Research, 33:842-861, 1985
12. A. Schrijver. On cutting planes. Annals of Discrete Mathematics, 9:291-296, 1980
13. L. A. Wolsey. Faces of linear inequalities in 0-1 variables. Mathematical Program- ming, 8:165-178, 1975.