Bidirected and unidirected capacity installation in telecommunication networks

Discrete Applied Mathematics

Volumn 133, Issue 1-3, 2003, Pages 103-121

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

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Network loading; Polyhedral combinatorics; Telecommunication network design

Indexed keywords

BIFURCATION (MATHEMATICS); CHANNEL CAPACITY; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

NETWORK LOADING;

TELECOMMUNICATION NETWORKS;

EID: 0242335188     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00436-0     Document Type: Conference Paper

References (19)

1. Atamturk A., Rajan D. On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Programming Ser. A. 92(2):2002;315-333.
2. Balas E. Facets of the knapsack polytope. Math. Programming. 8:1975;146-164.
3. Barahona F. Network design using cut inequalities. SIAM J. Optim. 6:1996;823-837.
4. Barahona F. On the. k-cut problem Oper. Res. Lett. 26(3):2000;99-105.
5. D. Bienstock, private communication, 1998.
6. Bienstock D., Chopra S., Günlük O., Tsai C.-Y. Minimum cost capacity installation for multicommodity network flows. Math. Programming. 81:1998;177-199. working paper.
7. Bienstock D., Günlük O. Capacitated network design - polyhedral structure and computation. ORSA J. Comput. 8:1996;243-260.
8. B. Brockmüller, O. Günlük, L.A. Wolsey, Designing private line networks - polyhedral analysis and computation, Discussion Paper 9647, Center for Operations Research and Econometrics, October 1996.
9. B. Brockmüller, O. Günlük, L.A. Wolsey, Designing private line networks - polyhedral analysis and computation, Discussion Paper 9647 revised, Center for Operations Research and Econometrics, March 1998.
10. CPLEX division of ILOG. CPLEX callable library, version 6.5, 1999.
11. Gavish B., Altinkemer K. Backbone network design tools with economic tradeoffs. ORSA J. Comput. 2(3):1990;236-252.
12. C.P.M. van Hoesel, A.M.C.A. Koster, R.L.M.J. van de Leensel, M.W.P. Savelsbergh, Polyhedral results for the edge capacity polytope, Technical Report ZIB 00-22, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany, 2000. Available at http://www.zib.de/koster/ .
13. R.L.M.J. van de Leensel, Models and algorithms for telecommunication network design, Ph.D. Thesis, Maastricht University, 1999.
14. Magnanti T.L., Mirchandani P., Vachani R. The convex hull of two-core capacitated network design problems. Math. Programming. 60:1993;223-250.
15. Magnanti T.L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43:1995;142-157.
16. Padberg M. A note on zero-one programming. Oper. Res. 23:1975;833-837.
17. S. Thienel, ABACUS: A Branch And CUt System, version 2.2, 1998.
18. R. Wessäly, Dimensioning Survivable Capacitated NETworks, Ph.D. Thesis, Technische Universität Berlin, 2000.
19. Wolsey L.A. Faces of linear inequalities in 0-1 variables. Math. Programming. 8:1975;165-178.