A hub location problem with fully interconnected backbone and access networks

Klincewicz, 1998, Hub location in backbone/tributary network design: a review, Location Science, 6, 307, 10.1016/S0966-8349(98)00042-4 Ernst, 1996, Efficient algorithms for the uncapacitated single allocation p-hub median problem, Location Science, 4, 139, 10.1016/S0966-8349(96)00011-3 Skorin-Kapov, 1996, Tight linear programming relaxations of uncapacitated p-hub median problems, European Journal of Operational Research, 94, 582, 10.1016/0377-2217(95)00100-X Crainic, 2001, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Discrete Applied Mathematics, 112, 73, 10.1016/S0166-218X(00)00310-3 Costa, 2005, A survey on benders decomposition applied to fixed-charge network design problems, Computers and Operations Research, 32, 1429, 10.1016/j.cor.2003.11.012 Feresmans, 2003, Generalized network design problems, European Journal of Operational Research, 148, 1, 10.1016/S0377-2217(02)00404-6 Thomadsen T, Stidsen T. The generalized fixed-charge network design problem. Computers and Operations Research 2005 [to appear]. Kellerer, 2004 Caprara, 1999, Exact solution of the quadratic knapsack problem, INFORMS Journal on Computing, 11, 125, 10.1287/ijoc.11.2.125 Johnson, 1993, Min-cut clustering, Mathematical Programming, 62, 133, 10.1007/BF01585164 Thomadsen T. Hierarchical network design. PhD thesis, Informatics and Mathematical Modelling, Technical University of Denmark, 2005. Barnhart, 1998, Branch-and-price: column generation for solving huge integer programs, Operations Research, 46, 316, 10.1287/opre.46.3.316 Vanderbeck, 1996, An exact algorithm for ip column generation, Operations Research Letters, 19, 151, 10.1016/0167-6377(96)00033-8 Ryan, 1981, An integer programming approach to scheduling, 269