𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parametric approach to solving bicriterion shortest path problems

✍ Scribed by John Mote; Ishwar Murthy; David L. Olson

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
855 KB
Volume
53
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri

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