A polyhedral study of integer variable upper bounds

Mathematics of Operations Research

Volumn 27, Issue 4, 2002, Pages 711-739

  Klabjan, Diego ^a   Nemhauser, George L ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Flow cover inequality; Integer programming; Integer variable upper bound

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

BRANCH-AND-CUT ALGORITHMS; INTEGER VARIABLE UPPER BOUNDS;

BOUNDARY CONDITIONS;

EID: 0036873869     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.4.711.300     Document Type: Article

References (11)

1. Aardal, K. 1998. Capacitated facility location: Separation algorithms and computational experience. Math. Programming 81 149-175.
2. Ahuja, R., T. Magnanti, J. Orlin, M. Reddy. 1995. Applications of network optimization. M. Ball, T. Magnanti, C. Monma, G. Nemhauser, eds. Network Models Elsevier Science, New York, 1-83.
3. Atamtük, A. 2002. On capacitated network design cut-set polyhedra. Math. Programming 92 425-437.
4. ____, G. Nemhauser, M. Savelsbergh. 2001. Valid inequalities for problems with additive variable upper bounds. Math. Programming (to appear). Available from http://www.ieor.berkeley.edu/~atamturk.
5. Bauer, P. 1997. Personal communication.
6. CPLEX Optimization 2002. Using the CPLEX Callable Library, 7.5 edn, ILOG Inc.
7. Gu, Z., G. Nemhauser, M. Savelsbergh. 1999. Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Programming 85 439-467.
8. ____, ____, ____, 2000. Sequence independent lifting. J. Combinat. Optim. 4 109-130.
9. Padberg, M., T. Van Roy, L. Wolsey. 1985. Valid linear inequalities for fixed charge problems. Oper. Res. 33 842-861.
10. Van Roy, T., L. Wolsey. 1986. Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. 14 199-213.
11. Wolsey, L. 1990. Valid inequalities for 0-1 knapsacks and MIPs with generalized upper bound constraints. Discrete Appl. Math. 29 251-261.