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 vertical bar V vertical bar <= 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 / Pasquale, Avella; Sassano, Antonio; Igor, Vasil'Ev. - In: MATHEMATICAL PROGRAMMING. - ISSN 0025-5610. - 109:1(2007), pp. 89-114. [10.1007/s10107-005-0700-6]
Computational study of large-scale p-Median problems
SASSANO, Antonio;
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 vertical bar V vertical bar <= 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.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2007_11573-691.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
317.26 kB
Formato
Adobe PDF
|
317.26 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
