✦ LIBER ✦

Lagrangian relaxation and enumeration for solving constrained shortest-path problems

✍ Scribed by W. Matthew Carlyle; Johannes O. Royset; R. Kevin Wood

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 157 KB
Volume: 52
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20247

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A shortest augmenting path method for so

A shortest augmenting path method for solving minimal perfect matching problems

✍ Ulrich Derigs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

Improved preprocessing, labeling and sca

Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem

✍ I. Dumitrescu; N. Boland 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

Simultaneous solution of Lagrangean dual

Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem

✍ Ranga Muhandiramge; Natashia Boland 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB