Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions

DOI10.1057/JORS.1991.134MaRDI QIDQ3983489zbMATH OpenOpenAlexFDO

Authors Lee Papayanopoulos, I. Douglas Moon

Publication date 27 June 1992

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.1991.134

zbMATH Keywords

franchise facilityinteractive graphical methodminimax locationminimum covering ellipse

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Continuous location (90B85)

Recommendations

• Layout of facilities with some fixed points
• Locating facilities by minimax relative to closest points of demand areas
• The multifacility maximin planar location problem with facility interaction
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• Minimax location with farthest Euclidean distances

Cited in

(4)

• The obnoxious p facility network location problem with facility interaction
• Solving the anti-covering location problem using Lagrangian relaxation
• The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
• Two-facility location games with minimum distance requirement

This page was built for publication: Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions

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