Obnoxious facility location in multiple dimensional space

DOI10.1007/s11750-022-00640-6zbMath1518.90044MaRDI QIDQ6113555

Atsuo Suzuki, Zvi Drezner, Pawel Jan Kalczynski

Publication date: 11 July 2023

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

optimal algorithmsobnoxious facilitymulti-dimensional space

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• The big cube small cube solution method for multidimensional facility location problems
• Geometrical properties of the Fermat-Weber problem
• Analytical models for locating undesirable facilities
• The obnoxious center problem on weighted cactus graphs.
• Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
• Review of obnoxious facilities location problems
• Some Properties of Location Problems with Block and Round Norms
• Minimax and maximin facility location problems on a sphere
• An algorithm for Weber's problem on the sphere
• The multifacility maximin planar location problem with facility interaction
• OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS

This page was built for publication: Obnoxious facility location in multiple dimensional space