Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?

DOI10.1057/JORS.1994.10MaRDI QIDQ4287629zbMATH OpenOpenAlexFDO

Authors G. Appa, Ioannis Giannikos

Publication date 1 November 1994

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

zbMATH Keywords

obnoxious facilitiesrectilinear distanceundesirable facility

Mathematics Subject Classification ID

Linear programming (90C05) Continuous location (90B85)

Recommendations

• Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• A single facility location problem with a weighted maximin-minimax rectilinear distance
• Location of Multiple Obnoxious Facilities
• A heuristic approach to the single facility maximin location problem

Cited in

(7)

• Location and layout planning. A survey
• scientific article; zbMATH DE number 2125698 (Why is no real title available?)
• \(k\)-integrality, an extension of total unimodularity
• An interactive solution approach for a bi-objective semi-desirable location problem
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• Planar expropriation problem with non-rigid rectangular facilities
• Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance

This page was built for publication: Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?

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