The multifacility maximin planar location problem with facility interaction

DOI10.1093/IMAMAN/DPL008MaRDI QIDQ5427781zbMATH OpenOpenAlexFDO

Authors S. B. Welch, Said Salhi, Zvi Drezner

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 boundcontinuous spacelocation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1253055
• An O\((n \log{}n)\) algorithm for a maxmin location problem
• Layout of facilities with some fixed points
• Multicriteria planar location problems
• A heuristic approach to the single facility maximin location problem

Cited in

(12)

• The Weber obnoxious facility location model: a big arc small arc approach
• Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
• Review of obnoxious facilities location problems
• Big segment small segment global optimization algorithm on networks
• Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
• scientific article; zbMATH DE number 1253055 (Why is no real title available?)
• A branch-and-bound method for absolute value programs
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
• Obnoxious facility location in multiple dimensional space
• The obnoxious facilities p-center problem with forbidden regions
• Simultaneous convexification for the planar obnoxious facility location problem
• Maximizing the number of obnoxious facilities to locate within a bounded region

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

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