Conflict-Driven Heuristics for Mixed Integer Programming

DOI10.1287/IJOC.2020.0973MaRDI QIDQ4995097zbMATH OpenOpenAlexFDO

Authors Jakob Witzig, Ambros M. Gleixner

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

mixed integer programmingprimal heuristicsbranch-and-boundconflict analysis

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Experiments with conflict analysis in mixed integer programming
• Conflict analysis in mixed integer programming
• Computational aspects of infeasibility analysis in mixed integer programming
• Conflict Analysis for MINLP

Cites work

• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• A note on performance profiles for benchmarking software
• A status report on conflict analysis in mixed integer nonlinear programming
• A tree-search algorithm for mixed integer programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Benchmarking optimization software with performance profiles.
• Branching rules revisited
• Conflict analysis in mixed integer programming
• Efficient intelligent backtracking using linear programming
• Experiments with conflict analysis in mixed integer programming
• Heuristics of the branch-cut-and-price-framework SCIP
• Local rapid learning for integer programs
• MIP: Theory and practice -- closing the gap
• MIPLIB 2003
• Measuring the impact of primal heuristics
• Mixed integer programming: analyzing 12 years of progress
• Noncommercial software for mixed-integer linear programming
• RENS. The optimal rounding
• Rapid learning for binary programs
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study

Cited in

(8)

• A conflict-directed approach to chance-constrained mixed logical linear programming
• Computational aspects of infeasibility analysis in mixed integer programming
• Last fifty years of integer linear programming: a focus on recent practical advances
• Pivot and shift -- a mixed integer programming heuristic
• IntSat: integer linear programming by conflict-driven constraint learning
• Implications, conflicts, and reductions for Steiner trees
• Feasibility jump: an LP-free Lagrangian MIP heuristic
• A diving heuristic for mixed-integer problems with unbounded semi-continuous variables

Describes a project that uses

Uses Software

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

This page was built for publication: Conflict-Driven Heuristics for Mixed Integer Programming

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