✦ LIBER ✦

A branch-and-bound algorithm for the supply connected location-allocation problem on networks

✍ Scribed by Gülcan N. Yeşilkökçen; George O. Wesolowsky

Book ID: 119579059
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 250 KB
Volume: 6
Category: Article
ISSN: 0966-8349
DOI: 10.1016/s0966-8349(98)00060-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for the mul

A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

✍ Dong-wan Tcha; Bum-il Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 518 KB

A Branch-and-Bound Algorithm for Concave

A Branch-and-Bound Algorithm for Concave Network Flow Problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 279 KB

A Branch and Bound Algorithm for An Unca

A Branch and Bound Algorithm for An Uncapacitated Facility Location Problem with a Side Constraint

✍ A. Klose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB

A branch and bound algorithm for an unca

A branch and bound algorithm for an uncapacitated facility location problem with a side constraint

✍ Andreas Klose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

A branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 KB

A branch and bound algorithm for the tra

A branch and bound algorithm for the traveling purchaser problem

✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm