Minimum cost path problems with relays
暂无分享,去创建一个
[1] Raymond A. Patterson,et al. The network design problem with relays , 2007, Eur. J. Oper. Res..
[2] E. Martins. On a multicriteria shortest path problem , 1984 .
[3] R Bellman,et al. On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.
[4] Edgar Alberto Cabral. Wide area telecommunication network design: problems and solution algorithms with application to the alberta supernet , 2005 .
[5] Gilbert Laporte,et al. Locating Postal Relay Boxes Using a set Covering Algorithm , 1989 .
[6] Kim Allan Andersen,et al. A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..
[7] R. Musmanno,et al. Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .
[8] D. Shier,et al. An empirical investigation of some bicriterion shortest path algorithms , 1989 .
[9] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[10] Gilbert Laporte,et al. The Black and White Traveling Salesman Problem , 2006, Oper. Res..
[11] Raymond A. Patterson,et al. Wide area telecommunication network design: application to the Alberta SuperNet , 2008, J. Oper. Res. Soc..