The multifacility maximin planar location problem with facility interaction

DOI10.1093/imaman/dpl008zbMath1126.90048OpenAlexW2002783836MaRDI QIDQ5427781

Said Salhi, Zvi Drezner, S. B. Welch

Publication date: 27 November 2007

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/dpl008

zbMATH Keywords

branch and boundlocationcontinuous space

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items (8)

Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Review of obnoxious facilities location problems ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ Obnoxious facility location in multiple dimensional space ⋮ A branch-and-bound method for absolute value programs ⋮ Maximizing the number of obnoxious facilities to locate within a bounded region ⋮ Big segment small segment global optimization algorithm on networks

This page was built for publication: The multifacility maximin planar location problem with facility interaction