✦ LIBER ✦

Local Search Algorithms for the Red-Blue Median Problem

✍ Scribed by M. Hajiaghayi; R. Khandekar; G. Kortsarz

Book ID: 113044284
Publisher: Springer
Year: 2011
Tongue: English
Weight: 794 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9547-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local Search Heuristics for Capacitatedp

Local Search Heuristics for Capacitatedp-Median Problems

✍ Luiz Antonio Nogueira Lorena; Edson Luiz França Senne 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 85 KB

A tree search algorithm for the p-median

A tree search algorithm for the p-median problem

✍ N. Christofides; J.E. Beasley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 659 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

Local search algorithms for the radio li

Local search algorithms for the radio link frequency assignment problem

✍ S.R. Tiourine; C.A.J. Hurkens; J.K. Lenstra 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 167 KB

Local Search Genetic Algorithms for the

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

✍ Beatrice M. Ombuki; Mario Ventresca 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 135 KB