Computational study of large-scale p-Median problems

• 成果类型: Article
• 署名作者: Avella, Pasquale; Sassano, Antonio; Vasil'ev, Igor
• 署名单位: University of Sannio; Sapienza University Rome; University of Salerno; Irkutsk Science Centre of the Russian Academy of Sciences; Russian Academy of Sciences; Matrosov Institute for System Dynamics & Control Theory SB RAS
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-005-0700-6
• 发表日期: 2007
• 页码: 89-114
• 关键词: algorithm; location; search

摘要

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.