An Exact Solution for the Capacitated Multiple Allocation Hub Location Problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] James F. Campbell,et al. Integer programming formulations of discrete hub location problems , 1994 .
[3] M. O'Kelly,et al. A quadratic integer program for the location of interacting hub facilities , 1987 .
[4] Sibel A. Alumur,et al. Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..
[5] Andreas T. Ernst,et al. Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .
[6] Andreas T. Ernst,et al. The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..
[7] Claudio B. Cunha,et al. A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..
[8] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[9] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[10] Andreas T. Ernst,et al. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem , 1998 .