Sciweavers

279 search results - page 1 / 56
» Reduction approaches for robust shortest path problems
Sort
View
COR
2011
12 years 11 months ago
Reduction approaches for robust shortest path problems
Daniele Catanzaro, Martine Labbé, Martha Sa...
4OR
2005
104views more  4OR 2005»
13 years 4 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
COR
2004
146views more  COR 2004»
13 years 4 months ago
An exact algorithm for the robust shortest path problem with interval data
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 ...
Roberto Montemanni, Luca Maria Gambardella
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
13 years 5 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
TON
2008
125views more  TON 2008»
13 years 4 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni