A New Algorithm for Locating Sources Among Destinations
From MaRDI portal
Cited in
(6)- A comparison of two dual-based procedures for solving the p-median problem
- A graph theoretical bound for the p-median problem
- A projection method for \(l_ p\) norm location-allocation problems
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- Affinity propagation and uncapacitated facility location problems
This page was built for publication: A New Algorithm for Locating Sources Among Destinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060777)