The most probable allocation solution for the p-median problem
From MaRDI portal
Publication:3389552
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated \(p\)-median problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An effective VNS for the capacitated \(p\)-median problem
- Benchmarking optimization software with performance profiles.
- Cell formation in industrial engineering. Theory, algorithms and experiments
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Generalized Benders decomposition
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Solution methods for thep-median problem: An annotated bibliography
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
Cited in
(2)
This page was built for publication: The most probable allocation solution for the \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389552)