1 CPLEX Optimization, Inc, "Using the CPLEX Callable Libarary" 1994
2 Skorin-Kapov, D., "Tight linear programming relaxations of uncapacitated p-hub median problems" 94 : 582-593, 1996
3 Sohn, J, "The single allocation problem in the interacting three?hub network" 35 : 17-25, 2000
4 O’Kelly, M. E, "The location of interacting hub facilities" 20 : 92-106, 1986
5 Canovas, L., "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique" 179 : 990-1007, 2007
6 Boland, N., "Preprocessing and cutting for multiple allocation and hub location problems" 155 : 638-653, 2004
7 Kim, J, "Optimal design of two-level hierarchical network with tree-star configuration" 22 (22): 273-281, 1992
8 Chung, S., "Optimal design of a distributed network with two-level hierarchical structure" 52 : 105-115, 1992
9 Kim, J., "Optimal desig of two-level distributed network with dual homing local connections" 27 : 555-563, 1995
10 Skorin-Kapov, D, "On tabu search for the location of interacting hub facilities" 73 : 502-509, 1994
1 CPLEX Optimization, Inc, "Using the CPLEX Callable Libarary" 1994
2 Skorin-Kapov, D., "Tight linear programming relaxations of uncapacitated p-hub median problems" 94 : 582-593, 1996
3 Sohn, J, "The single allocation problem in the interacting three?hub network" 35 : 17-25, 2000
4 O’Kelly, M. E, "The location of interacting hub facilities" 20 : 92-106, 1986
5 Canovas, L., "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique" 179 : 990-1007, 2007
6 Boland, N., "Preprocessing and cutting for multiple allocation and hub location problems" 155 : 638-653, 2004
7 Kim, J, "Optimal design of two-level hierarchical network with tree-star configuration" 22 (22): 273-281, 1992
8 Chung, S., "Optimal design of a distributed network with two-level hierarchical structure" 52 : 105-115, 1992
9 Kim, J., "Optimal desig of two-level distributed network with dual homing local connections" 27 : 555-563, 1995
10 Skorin-Kapov, D, "On tabu search for the location of interacting hub facilities" 73 : 502-509, 1994
11 Aykin, T., "Networking policies for hub-and-spoke systems with application to the air transportation system" 29 : 201-221, 1995
12 O’Kelly, M. E., "Lower bounds for the hub location problem" 41 (41): 713-721, 1995
13 Campbell, J. F, "Integer programming formulations of discrete hub location problems" 72 : 387-405, 1994
14 O’Kelly, M. E., "Hub network design with single and multiple allocation: A computational study" 4 : 125-138, 1996
15 Campbell, J. F., "Hub location and the p-hub median problem" 44 : 923-935, 1996
16 Klincewicz, J. G, "Heuristics for the p-hub location problem" 53 : 25-37, 1991
17 Sohn, J, "Efficient solution procedure and reduced size formulations for p-hub location problems" 108 : 118-126, 1998
18 Ernst, A. T, "Efficient algorithms for the uncapacitated single allocation p-hub median problem" 4 : 139-154, 1996
19 Klincewicz, J. G, "Avoiding local optima in the p-hub location problem using tabu search and grasp" 40 : 283-302, 1992
20 O’Kelly, M. E, "A quadratic integer program for the location of interacting hub facilities" 32 : 393-403, 1987
21 Sohn, J, "A linear program for the two?hub location problem" 100 : 617-622, 1997
22 Balakrishinan, A., "A dual-ascent procedure for large scale uncapacitated network design" 37 : 716-740, 1989