Some heuristic methods for solving \(p\)-median problems with a coverage constraint
type: Item
instance of: scholarly article
title: Some heuristic methods for solving \(p\)-median problems with a coverage constraint
zbMATH Open document ID: 1253.90141
author: Jesús Sáez-Aguado
author: Paula Camelia Trandafir
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6119362
zbMATH Keywords: location
zbMATH Keywords: \(p\)-median
zbMATH Keywords: coverage constraint
zbMATH Keywords: local search
zbMATH Keywords: GRASP
zbMATH Keywords: Lagrangean relaxation
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
describes a project that uses: XPRESS
describes a project that uses: SITATION
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.02.011
OpenAlex ID: W2031485519
cites work: A Lagrangean relaxation method for the constrained assignment problem
cites work: Shortest chain subject to side constraints
cites work: An effective heuristic for large-scale capacitated facility location problems
cites work: Computational study of large-scale \(p\)-median problems
cites work: The Optimal Diversity Management Problem
cites work: A Heuristic Method for the Set Covering Problem
cites work: A Lagrangian heuristic algorithm for a real-world train timetabling problem
cites work: Multiobjective programming and planning
cites work: Q4857376
cites work: Multicriteria Optimization
cites work: Searching for the Multiplier in One-Constraint Optimization Problems
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Cluster analysis and mathematical programming
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q5687198
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: Q4452897
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: A hybrid multistart heuristic for the uncapacitated facility location problem
cites work: A fast swap-based local search procedure for location problems
cites work: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
cites work: Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
cites work: The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
DOI: 10.1016/J.EJOR.2012.02.011
description: scientific article; zbMATH DE number 6119362