Location of an Obnoxious Route

DOI10.1057/JORS.1989.174MaRDI QIDQ3033533zbMATH OpenOpenAlexFDO

Authors Zvi Drezner, George O. Wesolowsky

Publication date 1989

Published in The 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

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

Recommendations

• scientific article; zbMATH DE number 1340524
• Location of a facility minimizing nuisance to or from a planar network
• Location of Multiple Obnoxious Facilities
• scientific article; zbMATH DE number 4100913
• The maximin-maxisum network location problem

Cited in

(9)

• Operations research and environmental planning
• Continuous location of dimensional structures.
• Computing obnoxious 1-corner polygonal chains
• The maximin HAZMAT routing problem
• scientific article; zbMATH DE number 1340524 (Why is no real title available?)
• The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
• THE LARGEST EMPTY ANNULUS PROBLEM
• Locating an obnoxious line among planar objects
• The maximin line problem with regional demand

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033533)