✦ LIBER ✦

Local search algorithms for the problem of competitive location of enterprises

✍ Scribed by V. L. Beresnev

Book ID: 114988356
Publisher: SP MAIK Nauka/Interperiodica
Year: 2012
Tongue: English
Weight: 199 KB
Volume: 73
Category: Article
ISSN: 0005-1179
DOI: 10.1134/s0005117912030022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomized local search for the discrete

Randomized local search for the discrete competitive facility location problem

✍ Mel’nikov, A. A. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 223 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

Local search heuristics for the mobile f

Local search heuristics for the mobile facility location problem

✍ Halper, Russell; Raghavan, S.; Sahin, Mustafa 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Local Search Algorithms for the Red-Blue

Local Search Algorithms for the Red-Blue Median Problem

✍ M. Hajiaghayi; R. Khandekar; G. Kortsarz 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 794 KB

Efficient local search algorithms for th

Efficient local search algorithms for the linear ordering problem

✍ Celso S. Sakuraba; Mutsunori Yagiura 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

Local search algorithms for the k-cardin

Local search algorithms for the k-cardinality tree problem

✍ Christian Blum; Matthias Ehrgott 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th