Minimum cost path problems with relays
- 31 January 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (1), 165-173
- https://doi.org/10.1016/j.cor.2010.04.010
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Wide area telecommunication network design: application to the Alberta SuperNetJournal of the Operational Research Society, 2008
- The network design problem with relaysEuropean Journal of Operational Research, 2007
- The Black and White Traveling Salesman ProblemOperations Research, 2006
- Label Correcting Methods to Solve Multicriteria Shortest Path ProblemsJournal of Optimization Theory and Applications, 2001
- A label correcting approach for solving bicriterion shortest-path problemsComputers & Operations Research, 2000
- Locating Postal Relay Boxes Using a set Covering AlgorithmAmerican Journal of Mathematical and Management Sciences, 1992
- An empirical investigation of some bicriterion shortest path algorithmsEuropean Journal of Operational Research, 1989
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984
- On the Theory of Dynamic ProgrammingProceedings of the National Academy of Sciences of the United States of America, 1952