Some heuristic methods for solving \(p\)-median problems with a coverage constraint
From MaRDI portal
Publication:1926741
DOI10.1016/j.ejor.2012.02.011zbMath1253.90141OpenAlexW2031485519MaRDI QIDQ1926741
Paula Camelia Trandafir, Jesús Sáez-Aguado
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.011
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
A model for clustering data from heterogeneous dissimilarities ⋮ A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Better guarantees for \(k\)-median with service installation costs ⋮ Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid multistart heuristic for the uncapacitated facility location problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- An effective heuristic for large-scale capacitated facility location problems
- A Lagrangean relaxation method for the constrained assignment problem
- Multiobjective programming and planning
- Cluster analysis and mathematical programming
- A hybrid heuristic for the \(p\)-median problem
- Lagrangean relaxation. (With comments and rejoinder).
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- A fast swap-based local search procedure for location problems
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Cluster Analysis: An Application of Lagrangian Relaxation
- Solution methods for thep-median problem: An annotated bibliography
- Shortest chain subject to side constraints
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Heuristic Method for the Set Covering Problem
- Multicriteria Optimization
- The Optimal Diversity Management Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Searching for the Multiplier in One-Constraint Optimization Problems
This page was built for publication: Some heuristic methods for solving \(p\)-median problems with a coverage constraint
