An efficient Benders decomposition for the \(p\)-median problem
From MaRDI portal
Publication:6167396
DOI10.1016/j.ejor.2022.11.033arXiv2111.13405OpenAlexW3217638872MaRDI QIDQ6167396
Cristian Duran-Mateluna, Zacharie Ales, Sourour Elloumi
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13405
\(p\)-median problemlocationBenders decompositioninteger programming formulationpolynomial separation algorithm
Related Items
Cites Work
- Metaheuristic applications on discrete facility location problems: a survey
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Partitioning procedures for solving mixed-variables programming problems
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- The Benders decomposition algorithm: a literature review
- An aggregation heuristic for large scale p-median problem
- A hybrid heuristic for the \(p\)-median problem
- Near-optimal large-scale k-medoids clustering
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- A tighter formulation of the \(p\)-median problem
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- A computational study for the p-median Problem
- Solving Large p-Median Problems with a Radius Formulation
- Solution methods for thep-median problem: An annotated bibliography
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Bounded Algorithm for the p-Median Problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- TSPLIB—A Traveling Salesman Problem Library
- Location Science
- The Optimal Diversity Management Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
