Related content

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

By Bilal Nehme   Galinier Philippe   Guibault Francois  

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

Springer Publishing Company

Access to resources Recommend Favorite

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

By Polacek Michael   Hartl Richard F.   Doerner Karl   Reimann Marc  

Journal of Heuristics, Vol. 10, Iss. 6, 2004-12 ,pp. : 613-627

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

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

By Prins Christian  

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 23-41

Springer Publishing Company

Access to resources Recommend Favorite

SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

By Zobolas G. I.   Tarantilis C. D.   Ioannou G.  

Cybernetics and Systems, Vol. 40, Iss. 4, 2009-05 ,pp. : 259-285

Taylor & Francis Ltd

Access to resources Recommend Favorite