The computational complexity of the relative robust shortest path problem with interval data-Reference-Cited by-同舟云学术

The computational complexity of the relative robust shortest path problem with interval data

Published:2004-11 Issue:3 Volume:158 Page:570-576
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Zieliński Paweł

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference9 articles.

1. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Mathematical Programming,2001

2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

3. O.E. Karaşan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, submitted to Management Science, August 2001, Available from

4. Robust Discrete Optimization and its Applications;Kouvelis,1997

5. R. Montemanni, L.M Gambardella, An algorithm for the relative robust shortest path problem with interval data, Technical Report IDSIA-05-02, Istituto dalle Molle di Studi sull'Intelligenza Artificiale, February 2002, Available from

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm Based on Morphological Operators for Shortness Path Planning;Algorithms;2024-04-29

2. Robust Shortest Path Problems;International Series in Operations Research & Management Science;2024

3. Robust Algorithms for TSP and Steiner Tree;ACM Transactions on Algorithms;2023-03-09

4. The Minmax Regret Longest Path of a Tree with Interval Edge Lengths;Advances in Information and Communication Technology;2023

5. Shortest Path Problems Under Uncertainty;Encyclopedia of Optimization;2022-09-21