Valid inequalities for problems with additive variable upper bounds

Mathematical Programming, Series B

Volumn 91, Issue 1, 2001, Pages 145-162

  Atamtürk, Alper ^a   Nemhauser, George L ^b   Savelsbergh, Martin W P ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012704635     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100235     Document Type: Article

References (16)

1. Alevras, D., Grötschel, M., Wessäly, R. (1998): Cost-efficient network synthesis from leased lines. Annals of Operations Research 76, 1-20
2. Atamtürk, A. (1998): Conflict graphs and flow models for mixed-integer linear optimization problems. PhD thesis, ISyE, Georgia Institute of Technology, Atlanta, USA
3. Atamtürk, A. (1999): Lifted flow pack facets of the single node fixed-charge flow polytope. Research report, IEOR, University of California at Berkeley. Available at http://ieor.berkeley. edu/∼atamturk
4. Balakrishnan, A., Magnanti, T.L., Shulman, A., Wong, R.T. (1991): Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research 33, 239-284
5. Bienstock, D., Günlük, O. (1996): Capacitated network design - Polyhedral structure and computation. INFORMS Journal on Computing 8, 243-259
6. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1998): Lifted covers inequalities for 0-1 integer programs: Computation. INFORMS Journal on Computing 10, 427-437
7. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1999): Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming 85, 439-467
8. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (2000): Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109-129
9. Martello, S., Toth, P. (1990): Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, Inc, New York
10. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S. (1994): MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15, 47-58
11. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. John Wiley and Sons, New York
12. Padberg, M.W., Van Roy, T.J., Wolsey, L.A. (1984): Valid linear inequalities for fixed charge problems. Operations Research 32, 842-861
13. Stallaert, J.I.A. (1997): The complementary class of generalized flow cover inequalities. Discrete Applied Mathematics 77, 73-80
14. Stoer, M., Dahl, G. (1994): A polyhedral approach to multicommodity survivable network. Numerische Mathematik 68, 149-167
15. Van Roy, T.J., Wolsey, L.A. (1986): Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 14, 199-213
16. Wolsey, L.A. (1977): Valid inequalities and superadditivity for 0/1 integer programs. Mathematics of Operations Research 2, 66-77