✦ LIBER ✦

Categorized bottleneck-minisum path problems on networks

✍ Scribed by Igor Averbakh; Oded Berman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 441 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90043-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minisum location problem on an undir

The minisum location problem on an undirected network with continuous link demands

✍ Samuel S Chiu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1008 KB

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

Node-disjoint paths and related problems

Node-disjoint paths and related problems on hierarchical cubic networks

✍ Jung-Sheng Fu; Gen-Huey Chen; Dyi-Rong Duh 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

The shortest path problem on large-scale

The shortest path problem on large-scale real-road networks

✍ G.A. Klunder; H.N. Post 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

On a parametric shortest path problem fr

On a parametric shortest path problem from primal—dual multicommodity network optimization

✍ George G. Polak 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 1 views