✦ LIBER ✦

Easy and hard bottleneck location problems

✍ Scribed by Wen-Lian Hsu; George L. Nemhauser

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 302 KB
Volume: 1
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(79)90044-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Easy problems are sometimes hard

✍ Ian P. Gent; Toby Walsh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 621 KB

We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that p

Quadratic bottleneck problems

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

Solving hard problems by easy methods: D

Solving hard problems by easy methods: Differential and integral quadrature

✍ Richard Bellman; Bayesteh Kashef; E. Stanley Lee; R. Vasudevan 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Utilizing Shelve Slots: Sufficiency Cond

Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems

✍ Moshe Dror; Benjamin T. Smith; Martin Trudeau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Trapezoidal matrices and the bottleneck

Trapezoidal matrices and the bottleneck assignment problem

✍ Katarína Cechlárová 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Eulerian location problems

✍ Ghiani, Gianpaolo; Laporte, Gilbert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

The problem of locating a set of depots in an arc routing context (with no side constraints) is addressed. In the case of one depot, it is shown that the problem can be transformed into a Rural Postman Problem (RPP). In the case of a set of depots, the problem is also reduced to an RPP if there are