✦ LIBER ✦

Efficient local search algorithms for the linear ordering problem

✍ Scribed by Celso S. Sakuraba; Mutsunori Yagiura

Book ID: 111206051
Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 641 KB
Volume: 17
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2010.00778.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Linear Ordering Problem: Instances,

The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms

✍ Tommaso Schiavinotto; Thomas Stützle 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 425 KB

The linear ordering problem: Instances,

The linear ordering problem: Instances, search space analysis and algorithms

✍ Tommaso Schiavinotto; Thomas Stützle 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 421 KB

Efficient Algorithms for Local Alignment

Efficient Algorithms for Local Alignment Search

✍ S. Rajasekaran; H. Nick; P.M. Pardalos; S. Sahni; G. Shaw 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 41 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

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

Efficient local search algorithms for kn

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

✍ D. Karapetyan; G. Gutin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 594 KB