An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
From MaRDI portal
Publication:2253990
DOI10.1016/j.ejor.2014.01.050zbMath1304.90121OpenAlexW1963872430MaRDI QIDQ2253990
Said Salhi, Chandra Ade Irawan, Maria Paola Scaparra
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.050
Learning and adaptive systems in artificial intelligence (68T05) Discrete location and assignment (90B80)
Related Items (10)
A quadtree-based allocation method for a class of large discrete Euclidean location problems ⋮ The min-p robust optimization approach for facility location problem under uncertainty ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ The conditional \(p\)-dispersion problem ⋮ Near-optimal large-scale k-medoids clustering ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On worst-case aggregation analysis for network location problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighbourhood search: methods and applications
- A new formulation for the conditional \(p\)-median and \(p\)-center problems
- Aggregation error for location models: Survey and analysis
- Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
- Analysis of aggregation errors for the \(p\)-median problem
- The demand partitioning method for reducing aggregation errors in \(p\)-median problems
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- COBRA: A new formulation of the classic \(p\)-median location problem
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- An aggregation heuristic for large scale p-median problem
- Data surrogation error in \(p\)-median models
- On the conditional \(p\)-median problem
- BEAMR: an exact and approximate model for the \(p\)-median problem
- A fast swap-based local search procedure for location problems
- Solving Large p-Median Problems with a Radius Formulation
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Technical Note—Conditional Location Problems on Networks
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Variable neighborhood search for the p-median
- Aggregation Error Bounds for a Class of Location Models
- Row-Column Aggregation for Rectilinear Distance p-Median Problems
- Variable neighborhood search: Principles and applications
This page was built for publication: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems