A Reactive Tabu Search algorithm with variable clustering for the Unicost Set Covering Problem

Author： Kinney Gary W.   Barnes J. Wesley   Colletti Bruce W.  

Publisher： Inderscience Publishers

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.2, Iss.2, 2007-02, pp. : 156-172

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 hybrid algorithm of simulated annealing and tabu search for graph colouring problem

By Pahlavani Ali   Eshghi Kourosh  

International Journal of Operational Research, Vol. 11, Iss. 2, 2011-06 ,pp. : 136-159

Inderscience Publishers

Access to resources Recommend Favorite

Genetic algorithm and Tabu search methods for care service scheduling problem and comparison between these two methods

By Aoyama I.   Sato H.   Nakajima K.  

Journal of the Operations Research Society of Japan, Vol. 44, Iss. 3, 2001-09 ,pp. : 280-280

Elsevier

Access to resources Recommend Favorite

Tabu Search Heuristics for the Crane Sequencing Problem

By McKendall Alan R.   Shang Jin  

International Journal of Operational Research, Vol. 3, Iss. 4, 2008-06 ,pp. : 412-429

Inderscience Publishers

Access to resources Recommend Favorite

A tabu search heuristic for the concentrator location problem

By Filho V.J.M.F.   Galvao R.D.  

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 189-209

Elsevier

Access to resources Recommend Favorite

Simple Lagrangian heuristic for the set covering problem

By Haddadi S.  

Location Science, Vol. 5, Iss. 3, 1997-10 ,pp. : 204-204

Elsevier

Access to resources Recommend Favorite