A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs

DOI10.1007/978-3-540-68155-7_35zbMath1142.90455OpenAlexW1539582202MaRDI QIDQ5387645

Andrew J. Miller, Mahdi Namazifar

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

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

Cites Work

• MINTO, a Mixed INTeger Optimizer
• Parallel branch, cut, and price for large-scale discrete optimization
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Unnamed Item

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