Location of an Obnoxious Route

DOI10.1057/jors.1989.174zbMath0691.90021OpenAlexW1984241921MaRDI QIDQ3033533

Zvi Drezner, George O. Wesolowsky

Publication date: 1989

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1989.174

zbMATH Keywords

location of a routenetwork minimal-cost problemsshortest weighted distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (8)

The maximin HAZMAT routing problem ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ THE LARGEST EMPTY ANNULUS PROBLEM ⋮ The maximin line problem with regional demand ⋮ Continuous location of dimensional structures. ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS ⋮ Operations research and environmental planning ⋮ Computing obnoxious 1-corner polygonal chains

This page was built for publication: Location of an Obnoxious Route