论文信息 - A 2-phase algorithm for solving the single allocation p-hub center problem - 字舞流文

A 2-phase algorithm for solving the single allocation p-hub center problem

Andreas T. Ernst | Mohan Krishnamoorthy | T. Meyer | M. Krishnamoorthy | T. Meyer

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

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

[3] Andreas T. Ernst,et al. An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems , 1998, INFORMS J. Comput..

[4] Bahar Yetis Kara,et al. On the single-assignment p-hub center problem , 2000, Eur. J. Oper. Res..

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

[6] T. Meyer. Hub Cover and Hub Center Problems , 2005 .

[7] Marco Dorigo,et al. Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[8] Timothy J. Lowe,et al. The p-hub center allocation problem , 2007, Eur. J. Oper. Res..

[9] Sibel A. Alumur,et al. Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[10] Gerhard J. Woeginger,et al. Uncapacitated single and multiple allocation p-hub center problems , 2009, Comput. Oper. Res..

[11] Elena O. Gavriliouk. Aggregation in hub location problems , 2009, Comput. Oper. Res..