Location of speed-up subnetworks
暂无分享,去创建一个
[1] Nicole Eggemann,et al. Minimizing the Oriented Diameter of a Planar Graph , 2009, Electron. Notes Discret. Math..
[2] John D. Lamb. Variable neighbourhood structures for cycle location problems , 2012, Eur. J. Oper. Res..
[3] G. Laporte,et al. Planning rapid transit networks , 2010 .
[4] S. M. Hedetniemi,et al. Linear Algorithms for Finding the Jordan Center and Path Center of a Tree , 1981 .
[5] Juan A. Mesa,et al. A review of extensive facility location in networks , 1996 .
[6] Justo Puerto,et al. Locating tree-shaped facilities using the ordered median objective , 2005, Math. Program..
[7] Iván A. Contreras,et al. General network design: A unified view of combined location and network design problems , 2012, Eur. J. Oper. Res..
[8] Adam Meyerson,et al. Minimizing Average Shortest Path Distances via Shortcut Edge Addition , 2009, APPROX-RANDOM.
[9] László A. Székely,et al. On subtrees of trees , 2005, Adv. Appl. Math..
[10] Xavier Muñoz,et al. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks , 2010, Texts in Theoretical Computer Science. An EATCS Series.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Pascual Fernández,et al. A Heuristic Procedure For Path Location With Multisource Demand , 2003 .
[13] Gabriel Gutiérrez-Jarpa,et al. Minimum cost path location for maximum traffic capture , 2010, Comput. Ind. Eng..
[14] Stefan Ruzika,et al. Reliable and Restricted Quickest Path Problems , 2011, INOC.
[15] Anita Schöbel,et al. Line planning in public transportation: models and methods , 2012, OR Spectr..
[16] Inmaculada Rodríguez Martín,et al. Locating median cycles in networks , 2005, Eur. J. Oper. Res..
[17] Martine Labbé,et al. On locating path- or tree-shaped facilities on networks , 1993, Networks.
[18] Stefan Nickel,et al. Hub Location Problems in Urban Traffic Networks , 2001 .