A hub location problem with fully interconnected backbone and access networks

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2520-2531

  Thomadsen, Tommy ^a   Larsen, Jesper ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Branch and price; Fully interconnected networks; Hierarchical networks; Hub location

Indexed keywords

INTERCONNECTION NETWORKS; LINEAR PROGRAMMING; MATHEMATICAL TECHNIQUES; SET THEORY;

COLUMN GENERATION SUBPROBLEMS; QUADRATIC KNAPSACK PROBLEMS; SET PARTITIONING MODEL;

PROBLEM SOLVING;

EID: 33846091115     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.09.018     Document Type: Article

References (14)

1. Klincewicz J. Hub location in backbone/tributary network design: a review. Location Science 6 (1998) 307-355
2. Ernst A., and Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 4 3 (1996) 139-154
3. Skorin-Kapov D., Skorin-Kapov J., and O'Kelly M. Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research 94 3 (1996) 582-593
4. Crainic T., Frangioni A., and Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics 112 1-3 (2001) 73-99
5. Costa A. A survey on benders decomposition applied to fixed-charge network design problems. Computers and Operations Research 32 6 (2005) 1429-1450
6. Feresmans C., Labbe M., and Laporte G. Generalized network design problems. European Journal of Operational Research 148 1 (2003) 1-13
7. Thomadsen T, Stidsen T. The generalized fixed-charge network design problem. Computers and Operations Research 2005 [to appear].
8. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin
9. Caprara A., Pisinger D., and Toth P. Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing 11 (1999) 125-137
10. Johnson E., Mehrotra A., and Nemhauser G. Min-cut clustering. Mathematical Programming 62 (1993) 133-151
11. Thomadsen T. Hierarchical network design. PhD thesis, Informatics and Mathematical Modelling, Technical University of Denmark, 2005.
12. Barnhart C., Johnson E., Nemhauser G., Savelsbergh M., and Vance P. Branch-and-price: column generation for solving huge integer programs. Operations Research 46 3 (1998) 316-329
13. Vanderbeck F., and Wolsey L. An exact algorithm for ip column generation. Operations Research Letters 19 4 (1996) 151-159
14. Ryan D., and Foster B. An integer programming approach to scheduling. In: Wren A. (Ed). Computer scheduling of public transport urban passenger vehicle and crew scheduling (1981), North-Holland, Amsterdam 269-280