Algorithms for the non-bifurcated network design problem

Journal of Heuristics

Volumn 15, Issue 3, 2009, Pages 259-281

  Bartolini, Enrico ^a   Mingozzi, Aristide ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Heuristic algorithms; Integer programming; Network design; Partial enumeration

Indexed keywords

CAPACITY INSTALLATIONS; COMMODITY FLOWS; COMPUTATIONAL RESULTS; CONDITION FOR OPTIMALITY; ENUMERATION METHODS; EXACT ALGORITHMS; FEASIBLE SOLUTIONS; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; PARTIAL ENUMERATION; SINGLE PATHS; TABU SEARCH METHODS; TEST PROBLEMS;

DESIGN; DYNAMIC PROGRAMMING; HEURISTIC METHODS; INSTALLATION; INTEGER PROGRAMMING; PORTALS; TABU SEARCH;

HEURISTIC ALGORITHMS;

EID: 64549112632     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-008-9091-1     Document Type: Article

References (28)

1. K. Agarwal 2002 Design of capacitated multicommodity networks with multiple facilities Oper. Res. 50 333 344
2. A. Atamtürk D. Rajan 2002 On splittable and unsplittable flow capacitated network design arc-set polyhedra Math. Program. 92 315 333
3. F. Barahona 1996 Network design using cut inequalities SIAM J. Optim. 6 823 837
4. F. Barahona 2000 On the k-cut problem Oper. Res. Lett. 26 99 105
5. C. Barnhart C.A. Hane P.H. Vance 2000 Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems Oper. Res. 48 318 326
6. D. Bienstock O. Günlük 1996 Capacitated network design-polyhedral structure and computation ORSA J. Comput. 8 243 260
7. D. Bienstock S. Chopra O. Günlük C.-Y. Tsai 1998 Minimum cost capacity installation for multicommodity network flows Math. Program. 81 177 199
8. Brockmüller, B., Günlük, O., Wolsey, L.A.: 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.: Designing private line networks-Polyhedral analysis and computation. Discussion Paper 9647 revised, Center for Operations Research and Econometrics, March 1998
10. CPLEX: ILOG CPLEX 10.1 callable library. ILOG (2007)
11. T.G. Crainic M. Gendreau J.M. Farvolden 2000 A simplex-based tabu search method for capacitated network design INFORMS J. Comput. 12 223 236
12. Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN (2007)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
14. B. Gavish K. Altinkemer 1990 Backbone network design tools with economic tradeoffs ORSA J. Comput. 2 236 252
15. I. Ghamlouche T.G. Crainic M. Gendreau 2003 Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design Oper. Res. 51 655 667
16. I. Ghamlouche T.G. Crainic M. Gendreau 2004 Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design Ann. Oper. Res. 131 109 133
17. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)
18. H. Höller S. Voß 2006 A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks Eur. J. Oper. Res. 171 787 796
19. H. Höller B. Melian S. Voß 2008 Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks Eur. J. Oper. Res. 191 691 704
20. K. Holmberg D. Yuan 2000 A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem Oper. Res. 48 461 481
21. I. Kousik D. Ghosh I. Murthy 1993 A heuristic procedure for leasing channels in telecommunications networks J. Oper. Res. Soc. 44 659 672
22. T.L. Magnanti R.T. Wong 1986 Network design and transportation planning: Models and algorithms Transp. Sci. 18 1 55
23. T.L. Magnanti P. Mirchandani R. Vachani 1993 The convex hull of two core capacitated network design problems Math. Program. 60 233 250
24. T.L. Magnanti P. Mirchandani R. Vachani 1995 Modeling and solving the two-facility capacitated network loading problem Oper. Res. 43 142 157
25. M. Minoux 1989 Network synthesis and optimum network design problems: Models, solution methods and applications Networks 19 313 360
26. S.P.M. van Hoesel A.M.C.A. Koster R.L.M.J. de Leensel M.W.P. Savelsbergh 2002 Polyhedral results for the edge capacity polytope Math. Program. 92 335 358
27. S.P.M. van Hoesel A.M.C.A. Koster R.L.M.J. de Leensel M.W.P. Savelsbergh 2004 Bidirected and unidirected capacity installation in telecommunication networks Discrete Appl. Math. 133 103 121
28. Wolsey, L.A.: Integer Programming. Wiley, New York (1998)