✦ LIBER ✦

A polynomial time dual algorithm for the Euclidean multifacility location problem

✍ Scribed by G.L. Xue; J.B. Rosen; P.M. Pardalos

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 323 KB
Volume: 18
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00050-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for the multifaci

An iterative algorithm for the multifacility minimax location problem with euclidean distances

✍ Christakis Charalambous 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 509 KB

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A polynomial-time algorithm for the chan

A polynomial-time algorithm for the change-making problem

✍ David Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 143 KB

A Lagrangean dual ascent algorithm for s

A Lagrangean dual ascent algorithm for simple plant location problems

✍ Monique Guignard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 539 KB

A dual simplex algorithm for the canonic

A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem

✍ H.P. Simão; J.M. Thizy 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 572 KB

A dual algorithm for the satisfiability

A dual algorithm for the satisfiability problem

✍ Yoshihiro Tanaka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 647 KB