𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving shortest path problems with a weight constraint and replenishment arcs

✍ Scribed by Olivia J. Smith; Natashia Boland; Hamish Waterer

Book ID
113553731
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
548 KB
Volume
39
Category
Article
ISSN
0305-0548

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 path problem on a network wit
A shortest path problem on a network with fuzzy arc lengths
✍ Shinkoh Okada; Timothy Soper πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 187 KB

We concentrate on a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. Introducing an order relation between fuzzy numbers based on "fuzzy min", a nondominated path or Pareto Optimal path from the speciΓΏed node to every other node is

Solving the all-pair shortest path query
Solving the all-pair shortest path query problem on interval and circular-arc graphs
✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently

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