✦ LIBER ✦

Lower bounds and a tabu search algorithm for

✍ Scribed by Mathieu Bouchard; Alain Hertz; Guy Desaulniers

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 598 KB
Volume: 17
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9106-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heterogeneous cooperative parallel sea

A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm

✍ Yi-Feng Hung; Wei-Chih Chen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 257 KB

A Tabu Search Algorithm for Job Shop Sch

A Tabu Search Algorithm for Job Shop Scheduling

✍ S. G. Ponnambalam; P. Aravindan; S. V. Rajesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 108 KB

Upper bounds for covering arrays by tabu

Upper bounds for covering arrays by tabu search

✍ Kari J. Nurmela 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A t-covering array is a collection of k vectors in a discrete space with the property that, in any t coordinate positions, all combinations of the coordinate values occur at least once. Such arrays have applications, for example, in software testing and data compression. Covering arrays are sometime

Lower bounding and tabu search procedure

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

✍ Alain Hertz; David Schindl; Nicolas Zufferey 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 164 KB

A tabu search Hooke and Jeeves algorithm

A tabu search Hooke and Jeeves algorithm for unconstrained optimization

✍ K.S. Al-Sultan; M.A. Al-Fawzan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A tabu-search-based algorithm for contin

A tabu-search-based algorithm for continuous multiminima problems

✍ Francesco Franzè; Nicolò Speciale 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views