✦ LIBER ✦

A tabu search heuristic for a sequence-dependent and

✍ Scribed by Gabriella Stecco; Jean-François Cordeau; Elena Moretti

Book ID: 106429576
Publisher: Springer US
Year: 2008
Tongue: English
Weight: 505 KB
Volume: 12
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-008-0068-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for the multipro

A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times

✍ Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 961 KB

A tabu-search-based heuristic for cluste

A tabu-search-based heuristic for clustering

✍ C.S. Sung; H.W. Jin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A tabu search algorithm for balancing a

A tabu search algorithm for balancing a sequence-dependent disassembly line

✍ Kalayci, Can B.; Gupta, Surendra M. 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 393 KB

A tabu search heuristic for the Steiner

A tabu search heuristic for the Steiner Tree Problem

✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

A tabu search heuristic for the concentr

A tabu search heuristic for the concentrator location problem

✍ V.J.M.F Filho; R.D Galvão 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

A Tabu Search Heuristic for the Capacita

A Tabu Search Heuristic for the Capacitated Arc Routing Problem

✍ Alain Hertz, Gilbert Laporte and Michel Mittaz 📂 Article 📅 2000 🏛 INFORMS 🌐 English ⚖ 282 KB