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

By Kinney Gary W.   Barnes J. Wesley   Colletti Bruce W.  

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

Inderscience Publishers

Access to resources Recommend Favorite

A Lagrangian relaxation heuristic for solving the multi-echelon, multi-commodity, close-loop supply chain network design problem

By Min Hokey   Ko Hyun Jeung   Park Byung In  

International Journal of Logistics Systems and Management, Vol. 1, Iss. 4, 2005-02 ,pp. : 382-404

Inderscience Publishers

Access to resources Recommend Favorite

A heuristic algorithm for the fixed charge problem

By Adlakha Veena  

OPSEARCH, Vol. 47, Iss. 2, 2010-06 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

A new directed branching heuristic for the pq-median problem

By Alminyana M.   Borras F.   Pastor J.T.  

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

Elsevier

Access to resources Recommend Favorite

A Lagrangean heuristic for the facility location problem with staircase costs

By Holmberg K.   Ling J.  

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

Elsevier

Access to resources Recommend Favorite