✦ LIBER ✦

Quadratic bottleneck problems

✍ Scribed by Abraham P. Punnen; Ruonan Zhang

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 163 KB
Volume: 58
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20446

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bottleneck transportation problem

✍ R. S. Garfinkel; M. R. Rao 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 326 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

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

The tree center problems and the relatio

The tree center problems and the relationship with the bottleneck knapsack problems

✍ Shioura, Akiyoshi; Shigeno, Maiko 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 57 KB 👁 2 views

The tree center problems are designed to find a subtree minimizing the maximum distance from any vertex. This paper shows that these problems in a tree network are related to the bottleneck knapsack problems and presents linear-time algorithms for the tree center problems by using the relation.

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit