Conflict-Driven Heuristics for Mixed Integer Programming

DOI10.1287/ijoc.2020.0973OpenAlexW3092303158MaRDI QIDQ4995097

Ambros M. Gleixner, Jakob Witzig

Publication date: 23 June 2021

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

Full work available at URL: https://arxiv.org/abs/1902.02615

zbMATH Keywords

branch-and-boundmixed integer programmingprimal heuristicsconflict analysis

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items

Feasibility jump: an LP-free Lagrangian MIP heuristic, Implications, conflicts, and reductions for Steiner trees, Computational aspects of infeasibility analysis in mixed integer programming

Uses Software

• SCIP
• MIPLIB
• Chaff
• MIPLIB2003
• GitHub
• IPET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• RENS. The optimal rounding
• Branching rules revisited
• Experiments with conflict analysis in mixed integer programming
• Local rapid learning for integer programs
• A status report on conflict analysis in mixed integer nonlinear programming
• Measuring the impact of primal heuristics
• MIPLIB 2003
• Conflict analysis in mixed integer programming
• Efficient Intelligent Backtracking Using Linear Programming
• Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
• An Automatic Method of Solving Discrete Programming Problems
• Rapid Learning for Binary Programs
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Mixed Integer Programming: Analyzing 12 Years of Progress
• A Note on Performance Profiles for Benchmarking Software
• Heuristics of the Branch-Cut-and-Price-Framework SCIP
• A tree-search algorithm for mixed integer programming problems
• Benchmarking optimization software with performance profiles.