Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median nodes) minimizing the total distance from the other nodes of the graph. We present a Branch-and- Cut-and-Price algorithm yielding provably good solutions for instances with |V| ≤ 3795. Key ingredients of the algorithm are a delayed column-and-row generation technique, exploiting the special structure of the formulation, to solve the LP-relaxation, and cutting planes to strengthen the formulation and limit the size of the enumeration tree.

Computational study of large-scale p-median problems

AVELLA P;
2007

Abstract

Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median nodes) minimizing the total distance from the other nodes of the graph. We present a Branch-and- Cut-and-Price algorithm yielding provably good solutions for instances with |V| ≤ 3795. Key ingredients of the algorithm are a delayed column-and-row generation technique, exploiting the special structure of the formulation, to solve the LP-relaxation, and cutting planes to strengthen the formulation and limit the size of the enumeration tree.
p-Median; Cutting planes; Branch-and-cut-and-Price
File in questo prodotto:
File Dimensione Formato  
Avella, Sassano, Vasiliev - Computational study of large-scale p-median problem.pdf

non disponibili

Licenza: Non specificato
Dimensione 317.26 kB
Formato Adobe PDF
317.26 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12070/2107
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 130
  • ???jsp.display-item.citation.isi??? 110
social impact