A branch and cut algorithm for the hierarchical network design problem

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 28-35

  Obreque, Carlos ^a,b   Donoso, Macarena ^a,c   Gutiérrez, Gabriel ^a,d   Marianov, Vladimir ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSIDAD DEL BÍO BÍO   (Chile)

^c UNIVERSIDAD DIEGO PORTALES   (Chile)

^d UNIVERSIDAD CATÓLICA DE LA SANTÍSIMA CONCEPCIÓN   (Chile)

Author keywords

Branch and cut; Cutting planes; Extensive facility location; Hierarchical networks

Indexed keywords

BASE MODELS; BINARY VARIABLES; BRANCH AND BOUNDS; BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; CUTTING PLANES; EXTENSIVE FACILITY LOCATION; HIERARCHICAL NETWORK; HIERARCHICAL NETWORKS; MINIMUM COST; OPTIMIZATION PACKAGES; SUB-NETWORK; TEST INSTANCES;

FACILITIES; LARGE SCALE SYSTEMS; LINEAR PROGRAMMING; LOCATION;

PROBLEM SOLVING;

EID: 69149098345     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.12.022     Document Type: Article

References (22)

1. Alp O., Erkut E., and Drezner Z. An efficient genetic algorithm for the p-median problem. Annals of Operations Research 122 (2003) 21-42. (accessed on 12.15.06)
2. Balakrishnan A., Magnanti T., and Mirchandani P. A dual-based algorithm for multi-level network design. Management Science 40 5 (1994) 567-581
3. Balakrishnan A., Magnanti T., and Mirchandani P. Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science 40 7 (1994) 846-867
4. Beasley, J., 2005. (accessed on 14.01.05).
5. Chopra S., and Tsai C. A branch-and-cut approach for minimum cost multi-level network design. Discrete Mathematics 242 (2002) 65-92
6. Current J. The design of a hierarchical transportation network with transshipment facilities. Transportation Science 22 4 (1988) 270-277
7. Current J., and Pirkul H. The Hierarchical network design problem with transshipment facilities. European Journal of Operational Research 52 (1991) 338-347
8. Current J., ReVelle C., and Cohon J. The hierarchical network design problem. European Journal of Operational Research 27 (1986) 57-66
9. Dantzig G., Fulkerson D., and Johnson S. Solution of a large-scale traveling-salesman problem. Operations Research 2 (1954) 393-410
10. Dror M., Laporte G., and Trudeau P. Vehicle routing with split deliveries. Discrete Applied Mathematics 50 (1994) 239-254
11. Duin C., and Volgenant A. Reducing the hierarchical network design problem. European Journal of Operational Research 39 (1989) 332-344
12. Duin C., and Volgenant A. Heuristics for the hierarchical network design problem. In: Lenstra J.K., Tijms H., and Volgenant A. (Eds). Twenty-Five Years of Operations Research in the Netherlands CWI Tract 70 (1990), Centre for Mathematics and Computer Science, Amsterdam, The Netherlands
13. Duin C., and Volgenant A. The multi-weighted Steiner tree problem. Annals of Operations Research 33 (1991) 451-469
14. Gouveia L., and Telhada J. An augmented arborescence formulation for the two-level network design problem. Annals of Operations Research 106 1-4 (2001) 47-61
15. Koch T., and Martin A. Solving Steiner tree problems in graphs to optimality. Networks 32 (1998) 207-232
16. Magnanti T., and Wolsey L. Optimal trees. Handbooks in OR & MS 7 (1995) 503-615
17. Mirchandani P. The multi-tier tree problem. INFORMS Journal on Computing 8 3 (1996) 202-218
18. Obreque C., and Marianov V. An optimal procedure for solving the hierarchical network design problem. IIE Transactions 39 (2007) 513-524
19. Obreque C., Marianov V., and Ri{dotless}́os M. Optimal design of hierarchical network with free main path extremes. Operations Research Letters 36 (2008) 366-371
20. Pirkul H., Current J., and Nagarajan V. The hierarchical network design problem: A new formulation and solution procedures. Transportation Science 25 3 (1991) 175-182
21. Sancho N. A suboptimal solution to a hierarchical network design problem using dynamic programming. European Journal of Operational Research 83 (1995) 237-244
22. Sancho N. The hierarchical network design problem with multiple primary paths. European Journal of Operational Research 96 (1996) 323-328