The robust shortest path problem in series–parallel multidigraphs with interval data
- 1 January 2006
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 34 (1) , 69-76
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The computational complexity of the relative robust shortest path problem with interval dataEuropean Journal of Operational Research, 2004
- An exact algorithm for the robust shortest path problem with interval dataComputers & Operations Research, 2004
- A branch and bound algorithm for the robust shortest path problem with interval dataOperations Research Letters, 2004
- Interval data minmax regret network optimization problemsDiscrete Applied Mathematics, 2004
- On latest starting times and floats in activity networks with ill-known durationsEuropean Journal of Operational Research, 2003
- On the hardness of evaluating criticality of activities in a planar network with duration intervalsOperations Research Letters, 2003
- On the Robust Shortest Path ProblemComputers & Operations Research, 1998
- Robust Discrete Optimization and Its Applications1997
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982