The most probable allocation solution for the p-median problem
DOI10.22067/IJNAO.V10I2.84892zbMATH Open1485.90063OpenAlexW3116528151MaRDI QIDQ3389552FDOQ3389552
Authors: Mehdi Zaferanieh 
Publication date: 23 March 2022
Full work available at URL: https://ijnao.um.ac.ir/article_25491_b696fe76a27d7b4ad1eb7410dea37992.pdf
Recommendations
- The stochastic \(p\)-median problem with unknown cost probability distribution
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Median problems in networks
- The network \(p\)-median problem with discrete probabilistic demand weights
- The \(p\)-median problem under uncertainty
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- A column generation approach to capacitated \(p\)-median problems
- Generalized Benders decomposition
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Solution methods for thep-median problem: An annotated bibliography
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Cell formation in industrial engineering. Theory, algorithms and experiments
- A branch‐and‐price algorithm for the capacitated p‐median problem
- An effective VNS for the capacitated \(p\)-median problem
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- 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)
