A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs

DOI10.1007/978-3-540-68155-7_35MaRDI QIDQ5387645zbMATH OpenOpenAlexFDO

Authors Mahdi Namazifar, Andrew J. Miller

Publication date 27 May 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68155-7_35

zbMATH Keywords

Branch-and-BoundMixed Integer ProgrammingHigh-Performance ComputingPrimal Heuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Recommendations

• Using diversification, communication and parallelism to solve mixed-integer linear programs
• scientific article; zbMATH DE number 1206103
• Distributed solving of mixed-integer programs with GLPK and Thrift
• Computational experience with a software framework for parallel integer programming
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5

Cites work

• scientific article; zbMATH DE number 2084782 (Why is no real title available?)
• Exploring relaxation induced neighborhoods to improve MIP solutions
• MINTO, a Mixed INTeger Optimizer
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Parallel branch, cut, and price for large-scale discrete optimization

Cited in

(6)

• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
• Parallel branch, cut, and price for large-scale discrete optimization
• Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems

This page was built for publication: A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs

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