✦ LIBER ✦

A decomposition algorithm for linear relaxation of the weightedr-covering problem

✍ Scribed by S. Agarwal; A. K. Mittal; P. Sharma

Book ID: 110572975
Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 400 KB
Volume: 31
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf02591862

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A relaxation/decomposition algorithm for

A relaxation/decomposition algorithm for the fixed charged network problem

✍ Bala Shetty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 789 KB

A genetic algorithm for the set covering

A genetic algorithm for the set covering problem

✍ J.E Beasley; P.C Chu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 939 KB

A linear-time approximation algorithm fo

A linear-time approximation algorithm for the weighted vertex cover problem

✍ R Bar-Yehuda; S Even 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A matrix decomposition MFS algorithm for

A matrix decomposition MFS algorithm for certain linear elasticity problems

✍ A. Karageorghis; Y. -S. Smyrlis; T. Tsangaris 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 917 KB

Linear time algorithms for approximating

Linear time algorithms for approximating the facility terminal cover problem

✍ Guang Xu; Yang Yang; Jinhui Xu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

A dual algorithm for the minimum coverin

A dual algorithm for the minimum covering ball problem in

✍ P.M. Dearing; Christiane R. Zeck 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 953 KB

A dual type algorithm constructs the minimum covering ball of a given finite set of points in R n by finding the minimum covering balls of a sequence of subsets, each with no more than n + 1 points and with strictly increasing radius, until all points are covered.