A Polyhedral Study of Integer Variable Upper Bounds

References

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