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 条
  • [1] Computational study of large-scale p-Median problems
    Avella, Pasquale
    Sassano, Antonio
    Vasil'ev, Igor
    [J]. MATHEMATICAL PROGRAMMING, 2007, 109 (01) : 89 - 114
  • [2] A distributed algorithm for solving large-scale p-median problems using expectation maximization
    Gwalani, Harsha
    Helsing, Joseph
    Alshammari, Sultanah M.
    Tiwari, Chetan
    Mikler, Armin R.
    [J]. PeerJ Computer Science, 2024, 10 : 1 - 24
  • [3] On solving large p-median problems
    Mu, Wangshu
    Tong, Daoqin
    [J]. ENVIRONMENT AND PLANNING B-URBAN ANALYTICS AND CITY SCIENCE, 2020, 47 (06) : 981 - 996
  • [4] A Computational Comparison of Different Algorithms for Very Large p-median Problems
    Rebreyend, Pascal
    Lemarchand, Laurent
    Euler, Reinhardt
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2015, 2015, 9026 : 13 - 24
  • [5] A NOTE ON SOLVING LARGE P-MEDIAN PROBLEMS
    BEASLEY, JE
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 270 - 273
  • [6] Solving Large p-Median Problems with a Radius Formulation
    Garcia, Sergio
    Labbe, Martine
    Marin, Alfredo
    [J]. INFORMS JOURNAL ON COMPUTING, 2011, 23 (04) : 546 - 556
  • [7] An aggregation heuristic for large scale p-median problem
    Avella, Pasquale
    Boccia, Maurizio
    Salerno, Saverio
    Vasilyev, Igor
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1625 - 1632
  • [8] A Fast Approximate Method for the Large-scale One-source P-median Problem
    Zhao, Runze
    Xiao, Yiyong
    Luo, Rui
    Zhang, Yue
    Liu, Xiaoyuan
    [J]. 2021 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM21), 2021, : 1696 - 1700
  • [9] Sequential radial approach to handle large p-median problems
    Janacek, Jaroslav
    Kvet, Marek
    [J]. 33RD INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS (MME 2015), 2015, : 315 - 320
  • [10] Data aggregation for p-median problems
    Bader F. AlBdaiwi
    Diptesh Ghosh
    Boris Goldengorin
    [J]. Journal of Combinatorial Optimization, 2011, 21 : 348 - 363
12345