A computational study for the \(p\)-median problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.90139
author: Sourour Elloumi
author: Agnès Plateau
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6033956
zbMATH Keywords: facility location
zbMATH Keywords: integer programming
zbMATH Keywords: column and row generation
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.058
OpenAlex ID: W2082513010
cites work: The Optimal Diversity Management Problem
cites work: A tighter formulation of the \(p\)-median problem
cites work: 10.1162/153244303765208403
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: A hybrid heuristic for the \(p\)-median problem
DOI: 10.1016/J.ENDM.2010.05.058
Recommended article: Computational study of large-scale \(p\)-median problems
Recommended article: Q3358523
Recommended article: Q3691386
Recommended article: Complexity evaluation of benchmark instances for the \(p\)-median problem
Recommended article: A tighter formulation of the \(p\)-median problem
Recommended article: A new heuristic approach for the P-median problem
Recommended article: A note on solving large p-median problems
Recommended article: Solution methods for thep-median problem: An annotated bibliography
Recommended article: A dynamic programming heuristic for the \(P\)-median problem
title: A computational study for the \(p\)-median problem
description: scientific article; zbMATH DE number 6033956