On characterizing tighter formulations for 0-1 programs

European Journal of Operational Research

Volumn 106, Issue 1, 1998, Pages 172-176

  Escudero, L F ^a   Munoz S ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Covers; Integer programming; Knapsack constraints; Tighter formulations

Indexed keywords

EID: 0037629352     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00349-X     Document Type: Article

References (7)

1. B.L. Dietrich, L.F. Escudero, F. Chance, Efficient reformulation for 0-1 programs - methods and computational results, Discrete Applied Mathematics 42 (1993) 147-175.
2. L.F. Escudero, S. Martello, P. Toth, On tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems, Annals of Operations Research (to appear).
3. K.L. Hoffman, M.W. Padberg, Improving LP-representations of zero-one linear programs for branch-and-cut, SIAM Journal on Computing 3 (1991) 121-128.
4. G.L. Nemhauser, L.A. Wolsey, Integer programming and combinatorial optimization, Wiley, New York, 1988.
5. M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA Journal on Computing 6 (1994) 445-454.
6. E. Balas, S. Ceria, G. Cornuéjols, Mixed 0-1 programming by lift-and-project in a branch-and-cut framework, Management Science 42 (1996) 1229-1246.
7. E. Balas, S. Ceria, G. Cornuéjols, N. Natraj, Gomory cuts revisited, Operations Research Letters 19 (1996) 1-9.