PEBBL: an object-oriented framework for scalable parallel branch and bound

DOI10.1007/s12532-015-0087-1zbMath1329.90171OpenAlexW1473692043MaRDI QIDQ903924

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein

Publication date: 15 January 2016

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-015-0087-1

zbMATH Keywords

parallel computationbranch and bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel numerical computation (65Y05)

Related Items

Detecting almost symmetries of graphs, On parallel branch and bound frameworks for global optimization, Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization, PEBBL: an object-oriented framework for scalable parallel branch and bound, ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers, A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers, PEBBL, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

Uses Software

• ALPS
• LAPACK
• SCIP
• PICO
• ABACUS
• UG
• UCI-ml
• MINTO
• SYMPHONY
• MPI/MPICH
• FiberSCIP
• ParaSCIP
• BLIS
• BiCePS
• MPI
• CHiPPS
• OpenMPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A high-performance, portable implementation of the MPI message passing interface standard
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Introduction to ABACUS -- a branch-and-cut system
• Efficiency considerations in the implementation of parallel branch-and- bound
• MINTO, a Mixed INTeger Optimizer
• Toward efficient agnostic learning
• Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
• Logical analysis of numerical data
• Parallel branch, cut, and price for large-scale discrete optimization
• A library hierarchy for implementing scalable parallel search algorithms
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Could we use a million cores to solve an integer program?
• An Improved Branch-and-Bound Method for Maximum Monomial Agreement
• Computational Experience with a Software Framework for Parallel Integer Programming
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• How Much Communication Does Parallel Branch and Bound Need?
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Generating Multiple Solutions for Mixed Integer Programming Problems
• Linear programming boosting via column generation