✦ LIBER ✦

New models for the robust shortest path problem: complexity, resolution and generalization

✍ Scribed by Virginie Gabrel, Cécile Murat, Lei Wu

Book ID: 120966602
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 916 KB
Volume: 207
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-011-1004-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Bounds on the Complexity of the Shor

New Bounds on the Complexity of the Shortest Path Problem

✍ Fredman, Michael L. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 674 KB

An enhanced exact procedure for the abso

An enhanced exact procedure for the absolute robust shortest path problem

✍ Maria Elena Bruni; Francesca Guerriero 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

Models and methods for the constrained s

Models and methods for the constrained shortest path problem and its variants

✍ Di Puglia Pugliese, Luigi 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 74 KB

Note on the Complexity of the Shortest P

Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW

✍ Moshe Dror 📂 Article 📅 1994 🏛 INFORMS 🌐 English ⚖ 122 KB

A branch and bound algorithm for the rob

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

✍ R. Montemanni; L.M. Gambardella; A.V. Donati 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 239 KB

The time-dependent shortest pair of disj

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu