A composite-neighborhood tabu search approach to the traveling tournament problem

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.13, Iss.2, 2007-04, pp. : 189-207

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simulated annealing approach to the traveling tournament problem

By Anagnostopoulos A. Michel L. Hentenryck P. Vergados Y.

Journal of Scheduling, Vol. 9, Iss. 2, 2006-04 ,pp. : 177-193

Springer Publishing Company

Access to resources Recommend Favorite

A tabu search approach to the uncapacitated facility location problem

By Al-Sultan K.S. Al-Fawzan M.A.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 91-103

Springer Publishing Company

Access to resources Recommend Favorite

ConsNet—A tabu search approach to the spatially coherent conservation area network design problem

By Ciarleglio Michael Barnes J. Sarkar Sahotra

Journal of Heuristics, Vol. 16, Iss. 4, 2010-08 ,pp. : 537-557

Springer Publishing Company

Access to resources Recommend Favorite

An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

By Dauzère-Pérès S. Paulli J.

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 281-306

Springer Publishing Company

Access to resources Recommend Favorite

An Advanced Tabu Search Algorithm for the Job Shop Problem

By Nowicki Eugeniusz Smutnicki Czesław

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 145-159

Springer Publishing Company

Access to resources Recommend Favorite