Polyhedral results for the edge capacity polytope

Mathematical Programming, Series B

Volumn 92, Issue 2, 2002, Pages 335-358

  Van Hoesel, Stan P M ^a   Koster, Arie M C A ^c   Van De Leensel, Robert L M J ^b   Savelsbergh, Martin W P ^d  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b CQM   (Netherlands)

^c ZUSE INSTITUTE BERLIN   (Germany)

^d Georgia Institute of Technology   (United States)

Author keywords

Cutting planes; Knapsack with integer capacity; Mixed integer programming; Network design

Indexed keywords

BIFURCATION (MATHEMATICS); COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

CUTTING PLANES; KNAPSACK WITH INTEGER CAPACITY; MIXED INTEGER PROGRAMMING; NETWORK DESIGN;

GEOMETRY;

EID: 18844408900     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070200292     Document Type: Article

References (25)

1. Atamturk, A., Rajan, D. (2001): On splittable and unsplittable capacitated network design arc-set polyhedra. To appear in Mathematical Programming
2. Balas, E. (1975): Facets of the knapsack polytope. Mathematical Programming 8, 146-164
3. Barahona, F. (1996): Network design using cut inequalities. SIAM Journal on Optimization 6, 823-837
4. Barahona, F. (2000): On the k-cut problem. Operations Research Letters 26(3), 99-105
5. Bienstock, D., Bley, A. (2000): Proceedings in the 8th International Conference on Telecommunication Systems, March 9-12, 2000. Nashville
6. Bienstock, D., Chopra, S., Günlük, O., Tsai, C.-Y. (1998): Minimum cost capacity installation for multicommodity network flows. Mathematical Programming 81, 177-199, July 1998. Working paper
7. Bienstock, D., Günlük, O. (1996): Capacitated network design - polyhedral structure and computation. ORSA Journal on Computing 8, 243-260
8. Brockmüller, B., Günlük, O., Wolsey, L.A. (1996): Designing private line networks - polyhedral analysis and computation. Discussion Paper 9647, Center for Operations Research and Econometrics, October 1996
9. Brockmüller, B., Günlük, O., Wolsey, L.A. (1998): Designing private line networks - polyhedral analysis and computation. Discussion Paper 9647 revised, Center for Operations Research and Econometrics, March 1998
10. Garey, M.R., Johnson, D.S. (1979): Computers and intractability: a guide to the Theory of NP-Completeness. Freeman and Company, N.Y.
11. Gavish, B., Altinkemer, K. (1990): Backbone network design tools with economic tradeoffs. ORSA Journal on Computing 2(3), 236-252
12. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1998): Lifted cover inequalities for 0-1 integer programs: Complexity. INFORMS Journal on Computing 11, 117-123
13. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P. (1998): Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS Journal on Computing 10, 427-437
14. Hammer, P.L., Johnson, E.L., Peled, U.N. (1975): Facets of regular 0-1 polytopes. Mathematical Programming 8, 179-206
15. van Hoesel, C.P.M., Koster, A.M.C.A., van de Leensel, R.L.M.J., Savelsbergh, M.W.P. (2000): Polyhedral results for the edge capacity polytope. Technical Report ZIB 00-22, Konrad-Zusc-Zentrum für Informationstechnik Berlin, Berlin, Germany. Available at http://www.zib.de/koster/
16. CPLEX division of ILOG. CPLEX callable library, version 6.5, 1999
17. van de Leensel, R.L.M.J. (1999): Models and Algorithms for Telecommunication Network Design. PhD thesis, Maastricht University
18. Magnanti, T.L., Mirchandani, P., Vachani, R. (1993): The convex hull of two core capacitated network design problems. Mathematical Programming 60, 223-250
19. Magnanti, T.L., Mirchandani, P., Vachani, R. (1995): Modelling and solving the two-facility capacitated network loading problem. Operations Research 43, 142-157
20. Marchand, H., Wolsey, L.A. (1999): The 0-1 knapsack problem with a single continous variable. Math. Program. 85, 15-33
21. Padberg, M. (1975): A note on zero-one programming. Operations Research 23, 833-837
22. Thienel, S. (1998): ABACUS: A Branch And CUt System, version 2.2
23. Wessäly, R. (2000): Dimensioning Survivable Capacitated NETworks. PhD thesis, TU Berlin, Fakultät für Mathematik, Berlin, Germany, April 2000
24. Wolsey,L.A. (1975): Faces of linear inequalities in 0-1 variables. Mathematical Programming 8, 165-178
25. Wolsey, L.A. (1976): Facets and strong inequalities for integer programs. Operations Research 24, 367-372