✦ LIBER ✦

A polynomial time algorithm for a hemispherical minimax location problem

✍ Scribed by P. Das; N.R. Chakraborty; P.K. Chaudhuri

Book ID: 108410547
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 86 KB
Volume: 24
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(98)00047-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time dual algorithm for the

A polynomial time dual algorithm for the Euclidean multifacility location problem

✍ G.L. Xue; J.B. Rosen; P.M. Pardalos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Solution of an equiweighted minimax loca

Solution of an equiweighted minimax location problem on a hemisphere

✍ A. K. Sarkar; P. K. Chaudhuri 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 448 KB

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 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 dual algorithm for minimax problems

✍ Suxiang He 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 206 KB

A Polynomial Time Algorithm for Shaped P

A Polynomial Time Algorithm for Shaped Partition Problems

✍ Hwang, Frank K.; Onn, Shmuel; Rothblum, Uriel G. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB