Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On the robust shortest path problem
Computers and Operations Research
SIAM Journal on Computing
The robust spanning tree problem with interval data
Operations Research Letters
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
Combinatorial optimization in system configuration design
Automation and Remote Control
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
Deterministic risk control for cost-effective network connections
Theoretical Computer Science
Reduction approaches for robust shortest path problems
Computers and Operations Research
On robust online scheduling algorithms
Journal of Scheduling
A robust critical path in an environment with hybrid uncertainty
Applied Soft Computing
The robust shortest path problem in series-parallel multidigraphs with interval data
Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data
Operations Research Letters
Robust optimization of graph partitioning involving interval uncertainty
Theoretical Computer Science
On the robustness of graham's algorithm for online scheduling
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
Information Sciences: an International Journal
Robust vertex p-center model for locating urgent relief distribution centers
Computers and Operations Research
| Hi-index | 0.01 |
The robust deviation shortest path problem with interval data is studied in this paper.After the formulation of the problem in mathematical terms, an exact algorithm, based on a very simple concept, is described. Some practical improvements to the basic idea, which speed up the method, are also presented.Computational results corroborate the correctness of the conjecture on which the algorithnt is based and the potential of the approach. In particular, our method is proven to be able to retrieve high-quality solutions very quickly on some families of networks. For this reason, it could alternatively be used as a fast heuristic method.