A Lagrangean heuristic for the maximal covering location problem

Author： Galvao R.D.   ReVelle C.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.88, Iss.1, 1996-01, pp. : 114-123

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 comparison of Lagrangean and surrogate relaxations for the maximal covering location problem

By Galvao R.D.   Gonzalo Acosta Espejo L.   Boffey B.  

European Journal of Operational Research, Vol. 124, Iss. 2, 2000-07 ,pp. : 377-389

Elsevier

Access to resources Recommend Favorite

A Lagrangean heuristic for the facility location problem with staircase costs

By Holmberg K.   Ling J.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 63-74

Elsevier

Access to resources Recommend Favorite

An adaptation of SH heuristic to the location set covering problem

By Alminana M.   Pastor J.T.  

European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. : 586-593

Elsevier

Access to resources Recommend Favorite

Simple Lagrangian heuristic for the set covering problem

By Haddadi S.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 200-204

Elsevier

Access to resources Recommend Favorite

A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem

By Klose A.  

European Journal of Operational Research, Vol. 126, Iss. 2, 2000-10 ,pp. : 408-421

Elsevier

Access to resources Recommend Favorite