The most probable allocation solution for the p-median problem
From MaRDI portal
Publication:3389552
DOI10.22067/ijnao.v10i2.84892zbMath1485.90063OpenAlexW3116528151MaRDI QIDQ3389552
Publication date: 23 March 2022
Full work available at URL: https://ijnao.um.ac.ir/article_25491_b696fe76a27d7b4ad1eb7410dea37992.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Cell formation in industrial engineering. Theory, algorithms and experiments
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- An effective VNS for the capacitated \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- Generalized Benders decomposition
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Solution methods for thep-median problem: An annotated bibliography
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Benchmarking optimization software with performance profiles.
This page was built for publication: The most probable allocation solution for the p-median problem
