Computational experience with a software framework for parallel integer programming

DOI10.1287/IJOC.1090.0347MaRDI QIDQ2901073zbMATHOpenAlexFDO

Authors Yan Xu, Ted K. Ralphs, László Ladányi, Matthew J. Saltzman

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1090.0347

zbMATH Keywords

parallel algorithmbranch and boundtree search

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• Computational experience with parallel mixed integer programming in a distributed environment
• A parallel integer linear programming algorithm
• scientific article; zbMATH DE number 446513
• scientific article; zbMATH DE number 1894330
• scientific article; zbMATH DE number 2102778
• Improved parallel approximation of a class of integer programming problems
• scientific article; zbMATH DE number 3936932
• scientific article; zbMATH DE number 1264409
• scientific article; zbMATH DE number 2089166
• Integer-programming software systems

Cited in

(15)

• A library hierarchy for implementing scalable parallel search algorithms
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
• Parallelization of the FICO Xpress-Optimizer
• A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• SelfSplit parallelization for mixed-integer linear programming
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Could we use a million cores to solve an integer program?
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
• Benders decomposition: solving binary master problems by enumeration
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

Describes a project that uses

Uses Software

• ALPS
• PICO
• ABACUS
• MIPLIB
• MINTO
• SYMPHONY
• Concorde
• BonsaiG
• BLIS
• BiCePS
• CHiPPS
• MIPLIB2003
• COIN/BCP
• PEBBL

This page was built for publication: Computational experience with a software framework for parallel integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901073)