SelfSplit parallelization for mixed-integer linear programming

DOI10.1016/j.cor.2018.01.011zbMath1391.90429OpenAlexW2789875881MaRDI QIDQ1652584

Matteo Fischetti, Michele Monaci, Domenico Salvagnin

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11585/656428

zbMATH Keywords

parallel computingmixed-integer programmingcomputational analysisenumerative algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Parallel numerical computation (65Y05)

Related Items (1)

Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand

Uses Software

• FATCOP
• MapReduce
• SCIP
• MIPLIB
• GAMS
• Gecode
• CHiPPS
• PEBBL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principles and practice of constraint programming. 19th international conference, CP 2013, Uppsala, Sweden, September 16--20, 2013. Proceedings
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• On the exact solution of large-scale simple plant location problems
• An additive bounding procedure for the asymmetric travelling salesman problem
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Solving large quadratic assignment problems on computational grids
• Could we use a million cores to solve an integer program?
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• Early Estimates of the Size of Branch-and-Bound Trees
• Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
• Grid-Enabled Optimization with GAMS
• Transparent Parallelization of Constraint Programming
• Computational Experience with a Software Framework for Parallel Integer Programming
• Facets of the Asymmetric Traveling Salesman Polytope
• Estimating the Efficiency of Backtrack Programs
• Can Parallel Branch and Bound without Communication Be Effective?
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Exploiting Erraticism in Search
• Mixed Integer Programming: Analyzing 12 Years of Progress
• FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver

This page was built for publication: SelfSplit parallelization for mixed-integer linear programming