Computational study of large-scale p-Median problems

被引：0
|
作者：
Pasquale Avella
Antonio Sassano
Igor Vasil'ev
机构：
[1] Università del Sannio,Research Center on Software Technology
[2] Università di Roma ``La Sapienza'',Dipartimento di Informatica e Sistemistica
[3] Università di Salerno,Centro di Ricerca in Matematica Pura e Applicata
[4] Siberian Branch of Russian Academy of Sciences,Institute of System Dynamics and Control Theory
来源：
Mathematical Programming | 2007年 / 109卷
关键词：
-Median; cutting plane; column generation; branch-and-cut-and-price algorithm; 90C06; 90C10; 90C27; 90C35;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：89 / 114
页数：25
相关论文
共 50 条
  • [31] A FAST METHOD FOR LARGE-SCALE MULTICHROMOSOMAL BREAKPOINT MEDIAN PROBLEMS
    Boyd, Sylvia
    Haghighi, Maryam
    [J]. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2012, 10 (01)
  • [32] Large Neighborhood Search for the Capacitated P-Median Problem
    Gjergji, Ida
    Musliu, Nysret
    [J]. METAHEURISTICS, MIC 2024, PT II, 2024, 14754 : 158 - 173
  • [33] On the p-Median polytope
    Avella, P
    Sassano, A
    [J]. MATHEMATICAL PROGRAMMING, 2001, 89 (03) : 395 - 411
  • [34] On the p-Median polytope
    Pasquale Avella
    Antonio Sassano
    [J]. Mathematical Programming, 2001, 89 : 395 - 411
  • [35] A method of substructuring large-scale computational micromechanical problems
    Zohdi, TI
    Wriggers, P
    Huet, C
    [J]. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2001, 190 (43-44) : 5639 - 5656
  • [36] COMPUTATIONAL ASPECTS OF LARGE-SCALE QUADRATIC PROGRAMMING PROBLEMS
    WHINSTON, A
    [J]. OPERATIONS RESEARCH, 1965, S 13 : B157 - &
  • [37] A new formulation for the conditional p-median and p-center problems
    Berman, Oded
    Drezner, Zvi
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (04) : 481 - 483
  • [38] Solving large p-median clustering problems by primal-dual variable neighborhood search
    Hansen, Pierre
    Brimberg, Jack
    Urosevic, Dragan
    Mladenovic, Nenad
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2009, 19 (03) : 351 - 375
  • [39] Fuzzy interdiction/fortification location problems on p-median systems
    Maleki, Hamid Reza
    Khanduzi, Raheleh
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2016, 30 (03) : 1283 - 1292
  • [40] A branch-and-price approach to p-median location problems
    Senne, ELF
    Lorena, LAN
    Pereira, MA
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) : 1655 - 1664
12345