Using diversification, communication and parallelism to solve mixed-integer linear programs

DOI10.1016/j.orl.2013.12.012zbMath1408.90194OpenAlexW2087338755MaRDI QIDQ1667215

Peng Zhang

Publication date: 27 August 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.12.012

zbMATH Keywords

communicationinteger programmingbranch-and-boundparallelismdiversificationperformance variability

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (8)

Improving branch-and-cut performance by random sampling ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Complexity, algorithmic, and computational aspects of a dial-a-ride type problem ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ A dual heuristic for mixed integer programming

Uses Software

• UG
• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• ParaSCIP
• OpenMPI

Cites Work

• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• Could we use a million cores to solve an integer program?
• A two-stage parallel branch and bound algorithm for mixed integer programs
• Exploiting Erraticism in Search

This page was built for publication: Using diversification, communication and parallelism to solve mixed-integer linear programs