✦ LIBER ✦

On the bottleneck linear programming problem

✍ Scribed by C.R. Seshan; K.K. Achary

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 522 KB
Volume: 9
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(82)90178-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bilevel bottleneck programming problem

✍ Kanchan Mathur; M.C. Puri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 553 KB

On a certain problem in linear programmi

On a certain problem in linear programming

✍ R. J. Taylor; S. P. Thompson 📂 Article 📅 1958 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

The bottleneck transportation problem

✍ R. S. Garfinkel; M. R. Rao 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB

On a cardinality constrained linear prog

On a cardinality constrained linear programming knapsack problem

✍ Krzyszof Dudzinski 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A linear time algorithm for the Bottlene

A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

✍ Gurmeet Singh Manku 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 621 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