Title of article :
Discrete facility location and routing of obnoxious activities Original Research Article
Author/Authors :
P. Cappanera، نويسنده , , G. Gallo، نويسنده , , F. Maffioli، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
The problem of simultaneously locating obnoxious facilities and routing obnoxious materials between a set of built-up areas and the facilities is addressed.
Keywords :
Obnoxious location-routing , branch-and-bound , Lagrangean heuristic
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
