✦ LIBER ✦

The bottleneck transportation problem

✍ Scribed by R. S. Garfinkel; M. R. Rao

Publisher: John Wiley and Sons
Year: 1971
Tongue: English
Weight: 326 KB
Volume: 18
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800180404

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Communication on “the bottleneck transpo

Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”

✍ Peter L. Hammer 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

The bottleneck graph partition problem

✍ Hochbaum, Dorit S.; Pathria, Anu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

On three basic methods for solving bottl

On three basic methods for solving bottleneck transportation problems

✍ Ulrich Derigs 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 499 KB

For solving transportation problems essentially three types of methods are known: primal methods, the Hungarian method and the shortest augmenting path method. In this paper we present the specialization of these approaches to the bottleneck transportation problem and report some computational exper

Quadratic bottleneck problems

✍ Abraham P. Punnen; Ruonan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

Stochastic bottleneck spanning tree prob

Stochastic bottleneck spanning tree problem

✍ Hiroaki Ishii; Toshio Nishida 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

This paper considers a stochastic version of bottleneck spanning tree problem in which edge costs are random variables. The problem is to find an optimal spanning tree under the chance constraint with respect to bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a

The bottleneck problem with minimum quan

The bottleneck problem with minimum quantity commitments

✍ Andrew Lim; Zhou Xu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

## Abstract Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation