✦ LIBER ✦

Iterated tabu search for the circular open dimension problem

✍ Scribed by Fu, Zhanghua; Huang, Wenqi; Lü, Zhipeng

Book ID: 119234611
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 241 KB
Volume: 225
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.10.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iterated tabu search for the car sequenc

Iterated tabu search for the car sequencing problem

✍ Jean-François Cordeau; Gilbert Laporte; Federico Pasin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A tabu search algorithm for the Open Sho

A tabu search algorithm for the Open Shop problem

✍ David Alcaide; Joaquín Sicilia; Daniele Vigo 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 718 KB

A parallel iterated tabu search heuristi

A parallel iterated tabu search heuristic for vehicle routing problems

✍ Jean-François Cordeau; Mirko Maischberger 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Tabu search for the BWC problem

✍ Daniel Berend, Ephraim Korach, Shira Zucker 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 343 KB

Tabu search for the multilevel generaliz

Tabu search for the multilevel generalized assignment problem

✍ Manuel Laguna; James P. Kelly; JoséLuis González-Velarde; Fred Glover 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 905 KB

Tabu search for the Steiner problem in g

Tabu search for the Steiner problem in graphs

✍ Celso C. Ribeiro; Maurício C. De Souza 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o