Lifted flow cover inequalities for mixed 0-1 integer programs

Mathematical Programming, Series B

Volumn 85, Issue 3, 1999, Pages 439-467

  Gu, Zonghao ^a   Nemhauser, George L ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000788402     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050067     Document Type: Article

References (15)

1. Aardal, K. (1998): Capacitated facility location: separation algorithms and computational experience. Math. Program. 81, 149-175
2. Balas, E., Ceria, S., Cornuejols, G. (1993): A lift-and-projcct cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324
3. Balas, E., Ceria, S., Comuejols, G., Natraj, N. (1996): Gomory cuts revisited. Oper. Res. Lett. 19, 1-9
4. Bixby, R.E., Boyd, E.A., Dadmehr, S.S., Indovina, R.R. (1992): The MIPLIB Mixed Integer Programming Library. Technical Report R92-36, Rice University
5. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P. (1996): An Updated Mixed Integer Programming Library: MIPLIB 3.0. Report LEC-96-03, Georgia Institute of Technology, Atlanta
6. Comuejols, G., Sridharan, R., Thizy, J.-M. (1991): A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50, 280-297
7. Crowder, H., Johnson, E.L., Padberg, M.W. (1983): Solving Large Scale Zero-One Linear Programming Problems. Oper. Res. 31, 803-834
8. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1998): Lifted Cover Inequalities for 0-1 Integer Programs: Computation. IJOC 10, 427-437
9. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1995): Sequence Independent Lifting. Report LEC-95-08, Georgia Institute of Technology, Atlanta
10. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C. (1994): MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett. 15, 47-58
11. Nemhauser , G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. Wiley, New York
12. Padberg, M.W, Van Roy, T.J., Wolsey, L.A. (1985): Valid Linear Inequalities for Fixed Charge Problems. Oper. Res. 33, 842-861
13. Van Roy, T.J., Wolsey, L.A. (1986): Valid Inequalities for Mixed 0-1 Programs. Discrete Appl. Math. 14, 199-213
14. Van Roy, T.J., Wolsey, L.A. (1987): Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35, 45-57
15. Wolsey, L.A. (1989): Strong formulations for mixed integer programming: a survey. Math. Program. 45, 173-191