✦ LIBER ✦

Randomized local search for the discrete competitive facility location problem

✍ Scribed by Mel’nikov, A. A.

Book ID: 125392553
Publisher: SP MAIK Nauka/Interperiodica
Year: 2014
Tongue: English
Weight: 223 KB
Volume: 75
Category: Article
ISSN: 0005-1179
DOI: 10.1134/S0005117914040109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search algorithms for the problem

Local search algorithms for the problem of competitive location of enterprises

✍ V. L. Beresnev 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 199 KB

Approximate algorithms for the competiti

Approximate algorithms for the competitive facility location problem

✍ V. L. Beresnev; A. A. Mel’nikov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 552 KB

Kernel search for the capacitated facili

Kernel search for the capacitated facility location problem

✍ G. Guastaroba, M. G. Speranza 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 1013 KB

Upper bounds for objective functions of

Upper bounds for objective functions of discrete competitive facility location problems

✍ V. L. Beresnev 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 561 KB

The discrete Unconscious search and its

The discrete Unconscious search and its application to uncapacitated facility location problem

✍ Ardjmand, Ehsan; Park, Namkyu; Weckman, Gary; Amin-Naseri, Mohammad Reza 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 586 KB

Analysis of a Local Search Heuristic for

Analysis of a Local Search Heuristic for Facility Location Problems

✍ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati