An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
From MaRDI portal
Publication:3753766
Recommendations
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- scientific article; zbMATH DE number 1253055
- scientific article; zbMATH DE number 2185624
- An O\((n \log{}n)\) algorithm for a maxmin location problem
Cited in
(7)- Analytical models for locating undesirable facilities
- A fast algorithm for the rectilinear distance location problem
- \(k\)-integrality, an extension of total unimodularity
- An interactive solution approach for a bi-objective semi-desirable location problem
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- Some personal views on the current state and the future of locational analysis
- Planar expropriation problem with non-rigid rectangular facilities
This page was built for publication: An Enhancement of the Drezner-Wesolowsky Algorithm 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 Q3753766)