✦ LIBER ✦

The robust shortest path problem with interval data via Benders decomposition

✍ Scribed by Roberto Montemanni; Luca Maria Gambardella

Publisher: Springer
Year: 2005
Tongue: English
Weight: 113 KB
Volume: 3
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-005-0066-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The robust shortest path problem in seri

The robust shortest path problem in series–parallel multidigraphs with interval data

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 196 KB

In this paper the robust shortest path problem in edge series-parallel multidigraphs with interval costs is examined. The maximal regret criterion is applied to calculate the optimal solution. It is shown that this problem is NP-hard. A pseudopolynomial algorithm for the studied problem is construct

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

A Mixed Integer Programming Formulation

A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data

✍ Roberto Montemanni 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 176 KB