An iterated-tabu-search heuristic for a variant of the partial set covering problem

Author： Bilal Nehme   Galinier Philippe   Guibault Francois  

Publisher： Springer Publishing Company

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.20, Iss.2, 2014-04, pp. : 143-164

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

Related content

An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

By Macambira E.M.  

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 175-190

Springer Publishing Company

Access to resources Recommend Favorite

A tabu search heuristic for the component assignment problem in PCB assembly

By Wan Y.F.   Ji P  

Assembly Automation, Vol. 21, Iss. 3, 2001-07 ,pp. : 236-240

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Variable and large neighborhood search to solve the multiobjective set covering problem

By Lust T.   Tuyttens D.  

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 165-188

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the Set Covering Problem

By Caprara A.  

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 353-371

Springer Publishing Company

Access to resources Recommend Favorite

Modelling the machine loading problem of FMSs and its solution using a tabu-search-based heuristic

By Sarma U. M. B. S.   Kant Suman   Rai Rahul   Tiwari M. K.  

International Journal of Computer Integrated Manufacturing, Vol. 15, Iss. 4, 2002-07 ,pp. : 285-295

Taylor & Francis Ltd

Access to resources Recommend Favorite