Solving Structured Multifacility Location Problems Efficiently
From MaRDI portal
Recommendations
- Structured \(p\)-facility location problems on the line solvable in polynomial time
- An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- Location problems with grouped structure of demand: Complexity and algorithms
- A multifacility location problem on median spaces
Cited in
(14)- Locating facilities which interact: Some solvable cases
- Location problems with grouped structure of demand: Complexity and algorithms
- The Location of Undesirable Facilities
- On a rational stopping rule for facilities location algorithms
- An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
- Acceleration of the HAP approach for the multifacility location problem
- The multi-story space assignment problem
- The big cube small cube solution method for multidimensional facility location problems
- One more well-solved case of the multifacility location problem
- Complexity results for the \(p\)-median problem with mutual communication
- scientific article; zbMATH DE number 919278 (Why is no real title available?)
- Solving a continuous multifacility location problem by DC algorithms
- A distance constrained p-facility location problem on the real line
- scientific article; zbMATH DE number 4099005 (Why is no real title available?)
This page was built for publication: Solving Structured Multifacility Location Problems Efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302927)
