A branch and bound algorithm for the robust shortest path problem with interval data

Authors:
R. Montemanni;L. M. Gambardella;A. V. Donati
Affiliations:
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno, Switzerland;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno, Switzerland;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno, Switzerland
Venue:
Operations Research Letters
Year:
2004

Citing 3
Cited 14

On the robust shortest path problem

Computers and Operations Research
An exact algorithm for the robust shortest path problem with interval data

Computers and Operations Research
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
Ranking function-based solutions of fully fuzzified minimal cost flow problem

Information Sciences: an International Journal
The solution and duality of imprecise network problems

Computers & Mathematics with Applications
A new model for path planning with interval data

Computers and Operations Research
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
Heuristics for the central tree problem

Journal of Heuristics
Deterministic risk control for cost-effective network connections

Theoretical Computer Science
Reduction approaches for robust shortest path problems

Computers and Operations Research
Optimization algorithm of scheduling six parallel activities to three pairs order activities

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Research on the optimization decision-making two row-sequencing-pairs of activities with slacks

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Operations Research Letters
The robust shortest path problem in series-parallel multidigraphs with interval data

Operations Research Letters
Computing and minimizing the relative regret in combinatorial optimization with interval data

Discrete Optimization
On the minimum risk-sum path problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs. A branch and bound algorithm for this problem is presented.