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

DOI10.1057/JORS.1994.10zbMATH Open0798.90093OpenAlexW2048446449MaRDI QIDQ4287629FDOQ4287629

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

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

zbMATH Keywords

obnoxious facilitiesrectilinear distanceundesirable facility

Mathematics Subject Classification ID

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

Cited In (7)

• An interactive solution approach for a bi-objective semi-desirable location problem
• \(k\)-integrality, an extension of total unimodularity
• Planar expropriation problem with non-rigid rectangular facilities
• Location and layout planning. A survey
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• Title not available (Why is that?)
• 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)