The gradual covering decay location problem on a network

Author： Berman O.   Krass D.   Drezner Z.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.151, Iss.3, 2003-12, pp. : 474-480

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 Lagrangean heuristic for the maximal covering location problem

By Galvao R.D.   ReVelle C.  

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

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

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

The obnoxious p facility network location problem with facility interaction

By Welch S.B.   Salhi S.  

European Journal of Operational Research, Vol. 102, Iss. 2, 1997-10 ,pp. : 302-319

Elsevier

Access to resources Recommend Favorite

A competitive facility location problem on a tree network with stochastic weights

By Shiode S.   Drezner Z.  

European Journal of Operational Research, Vol. 149, Iss. 1, 2003-08 ,pp. : 47-52

Elsevier

Access to resources Recommend Favorite