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.
Titolo: | Computational study of large-scale p-median problems | |
Autori interni: | ||
Data di pubblicazione: | 2007 | |
Rivista: | ||
Handle: | http://hdl.handle.net/20.500.12070/2107 | |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
Avella, Sassano, Vasiliev - Computational study of large-scale p-median problem.pdf | N/A | Non specificato | Administrator Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.