Network design arc set with variable upper bounds

Networks

Volumn 50, Issue 1, 2007, Pages 17-28

  Atamtürk, Alper ^a   Günlük, Oktay ^b  

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

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Cutting planes; Flow covers; Mixed integer rounding; Network design

Indexed keywords

ELECTRIC ARCS; INTEGER PROGRAMMING; NETWORKS (CIRCUITS);

CUTTING PLANES; FLOW COVERS; NETWORK DESIGN;

ELECTRIC NETWORK ANALYSIS;

EID: 34547771778     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20162     Document Type: Article

References (29)

1. A. Atamtürk, Flow pack facets of the single node fixed-charge flow polytope, Oper Res Lett 29 (2001), 107-114.
2. A. Atamtürk, On capacitated network design cut-set polyhedra, Math Program 92 (2002), 425-137.
3. A. Atamtürk, On the facets of the mixed-integer knapsack polyhedron, Math Program 98 (2003), 145-175.
4. A. Atamtürk, Sequence independent lifting for mixed-integer programming, Oper Res 52 (2004), 487-490.
5. A. Atamtürk and O. Günlük, Network design arc set with variable upper bounds, IBM Research Report, RC23598, 2005.
6. A. Atamtürk and D. Rajan, On splittable and unsplittable flow capacitated network design arc-set polyhedra, Math Program 92(2002), 315-333.
7. E. Balas, Facets of the knapsack polytope, Math Program 8 (1975), 146-164.
8. E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J Appl Math 34 (1978), 119-148.
9. D. Bienstock and Günlük, Capacitated network designPolyhedral structure and computation, INFORMS J Comput 8 (1996), 243-259.
10. B. Brockmüller, O. Günlük, and L.A. Wolsey, Designing private line networks-Polyhedral analysis and computation, CORE Discussion Paper 9647, Université Catholique de Louvain, Louvain-la-Nueve, Belgium, 1996.
11. Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Cover inequalities for 0-1 integer programs: Computation, INFOMRS J Comput 10 (1998), 427-437.
12. Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Cover inequalities for 0-1 integer programs: Complexity, INFORMS J Comput 11 (1999), 117-123.
13. Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Lifted flow cover inequalities for mixed 0-1 integer programs, Math Program 85 (1999), 439-467.
14. Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Sequence independent lifting in mixed integer programming, J Combin Optim 4 (2000), 109-129.
15. P.L. Hammer, E.L. Johnson, and U.N. Peled, Facets of regular 0-1 polytopes, Math Program 8 (1975), 179-206.
16. D. Klabjan and G.L. Nemhauser, A polyhedral study of integer variable upper bounds, Math Oper Res 27 (2002), 711-739.
17. Q. Louveaux and L.A. Wolsey, Lifting, superadditivity, mixed integer rounding, and single node flow sets revisited, CORE Discussion Paper 2003/1, Université Catholique de Louvain, Louvain-la-Nueve, Belgium, 2003.
18. T.L. Magnanti, P. Mirchandani, and R. Vachani, The convex hull of two core capacitated network design problems, Math Program 60 (1993), 233-250.
19. H. Marchand and L.A. Wolsey, Aggregation and mixed integer rounding to solve MIPs, Oper Res 49 (2001), 363-371.
20. G.L. Nemhauser and L.A. Wolsey, A recursive procedure for generating all cuts for 0-1 mixed integer programs, Math Program 46 (1990), 379-390.
21. M.W.Padberg, A note on 0-1 programming, Oper Res 23 (1979), 833-837.
22. M.W Padberg, T.. Van Roy, and L.A. Wolsey, Valid linear inequalities for fixed charge problems, Oper Res 32 (1984), 842-861.
23. J.I.A. Stallaert, The complementary class of generalized flow cover inequalities, Discrete Appl Math 77 (1997), 73-80.
24. S.P.M. van Hoesel, A.M.C.A. Koster, R.L.M., van de Leensel, and M.W.P. Savelsbergh, Polyhedral results for the edge capacity polytope, Math Program 92 (2002), 335-358.
25. L.A. Wolsey, Faces for linear inequality in 0-1 variables, Math Program 8 (1975), 165-178.
26. L.A. Wolsey, Facets and strong valid inequalities for integer programs, Oper Res 24 (1976), 367-372.
27. L.A. Wolsey, Integer programming, Wiley, New York, 1998.
28. E. Zemel, Lifting the facets of zero-one polytopes, Math Program 15 (1978), 268-277.
29. E. Zemel, Easily computable facets of the knapsack polytope, Math Oper Res 14 (1989), 760-764.