SelfSplit parallelization for mixed-integer linear programming

被引:1
|
作者
Fischetti, Matteo [1 ]
Monaci, Michele [2 ]
Salvagnin, Domenico [1 ]
机构
[1] Univ Padua, DEI, Padua, Italy
[2] Univ Bologna, DEI, Bologna, Italy
关键词
Parallel computing; Enumerative algorithms; Mixed-integer programming; Computational analysis; BOUND ALGORITHMS; BRANCH; COMMUNICATION; OPTIMIZATION;
D O I
10.1016/j.cor.2018.01.011
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
SelfSplit is a simple static mechanism to convert a sequential tree-search code into a parallel one. In this paradigm, tree-search is distributed among a set of identical workers, each of which is able to autonomously determine-without any communication with the other workers-the job parts it has to process. SelfSplit already proved quite effective in parallelizing Constraint Programming solvers. In the present paper we investigate the performance of SelfSplit when applied to a Mixed-Integer Linear Programming (MILP) solver. Both ad-hoc and general purpose MILP codes have been considered. Computational results show that SelfSplit, in spite of its simplicity, can achieve good speedups even in the MILP context. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:101 / 112
页数:12
相关论文
共 50 条
  • [21] A mixed-integer linear programming approach for robust state estimation
    Chen, Yanbo
    Ma, Jin
    JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2014, 2 (04) : 366 - 373
  • [22] Mixed-integer linear programming for computing optimal experimental designs
    Harman, Radoslav
    Rosa, Samuel
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2025, 234
  • [23] Optimizing Dynamic Evacuation Using Mixed-Integer Linear Programming
    Obaid, Hamoud Bin
    Trafalis, Theodore B.
    Abushaega, Mastoor M.
    Altherwi, Abdulhadi
    Hamzi, Ahmed
    MATHEMATICS, 2025, 13 (01)
  • [24] Solving the Traveling Telescope Problem with Mixed-integer Linear Programming
    Handley, Luke B.
    Petigura, Erik A.
    Misic, Velibor V.
    ASTRONOMICAL JOURNAL, 2024, 167 (01):
  • [25] Hybrid Quantum Benders' Decomposition For Mixed-integer Linear Programming
    Zhao, Zhongqi
    Fan, Lei
    Han, Zhu
    2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2022, : 2536 - 2540
  • [26] Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems
    Cococcioni, Marco
    Cudazzo, Alessandro
    Pappalardo, Massimo
    Sergeyev, Yaroslav D.
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS, PT II, 2020, 11974 : 337 - 345
  • [27] Grammatical evolution for constraint synthesis for mixed-integer linear programming
    Pawlak, Tomasz P.
    O'Neill, Michael
    SWARM AND EVOLUTIONARY COMPUTATION, 2021, 64
  • [28] Selection of postharvest technology routes by mixed-integer linear programming
    Maia, LOA
    Lago, RA
    Qassim, RY
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 49 (02) : 85 - 90
  • [29] Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
    Adelgren, Nathan
    Gupte, Akshay
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (02) : 909 - 933
  • [30] A linear mixed-integer programming approach for the unit commitment problem
    Sherali, HD
    Driscoll, PJ
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2000, 25 (1C) : 19 - 35