On Solution of the Capacitated Single Allocation Hub Location Problem

Compositions are described comprising blends of cured epichlorohydrin rubber and crystalline polyester.

[1]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[2]  Steve R. White,et al.  Concepts of scale in simulated annealing , 2008 .

[3]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[4]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[5]  Juan-José Salazar-González,et al.  Solving a capacitated hub location problem , 2008 .

[6]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[7]  Hande Yaman,et al.  Solving the hub location problem with modular link capacities , 2005, Comput. Oper. Res..

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9]  Martine Labbé,et al.  A branch and cut algorithm for hub location problems with single assignment , 2005, Math. Program..

[10]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[11]  Andreas T. Ernst,et al.  Solution algorithms for the capacitated single allocation hub location problem , 1999, Ann. Oper. Res..

[12]  Jeng-Fung Chen,et al.  A hybrid heuristic for the uncapacitated single allocation hub location problem , 2007 .

[13]  Roberto Tadei,et al.  Solving the Hub location problem in telecommunication network design: A local search approach , 2004, Networks.

[14]  Andreas T. Ernst,et al.  The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..

[15]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..