✦ LIBER ✦

Solving covering problems and the uncapacitated plant location problem on trees

✍ Scribed by Antoon Kolen

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 1010 KB
Volume: 12
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(83)90197-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of exact and approximate meth

Comparison of exact and approximate methods of solving the uncapacitated plant location problem

✍ Jean-Michel Thizy; Luk N. van Wassenhove; Basheer M. Khumawala 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 970 KB

Using to model and solve the uncapacitat

Using to model and solve the uncapacitated task allocation problem

✍ Mark Lewis; Bahram Alidaee; Gary Kochenberger 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper illustrates how large instances of the unconstrained task allocation problem can be effectively modeled and efficiently solved as unconstrained quadratic binary programs. Computational experience and a comparison to the state-ofthe-art commercial code (CPLEX) illustrate the attractiveness

The minimax multistop location problem o

The minimax multistop location problem on a tree

✍ O. Berman; D. Simchi-Levi; A. Tamir 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

Solving the set cover problem on a super

Solving the set cover problem on a supercomputer

✍ S.J Shyu; R.C.T Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 454 KB

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

Algorithms for solving the conditional c

Algorithms for solving the conditional covering problem on paths

✍ Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB