Experiments with conflict analysis in mixed integer programming

DOI10.1007/978-3-319-59776-8_17zbMath1489.68261arXiv1611.07887OpenAlexW2555363809MaRDI QIDQ2011593

Stefan Heinz, Timo Berthold, Jakob Witzig

Publication date: 4 August 2017

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Transferring information across restarts in MIP, Irreducible infeasible subsystems of semidefinite systems, Outer approximation with conic certificates for mixed-integer convex problems, Experiments with conflict analysis in mixed integer programming, Structure-driven fix-and-propagate heuristics for mixed integer programming, Computational aspects of infeasibility analysis in mixed integer programming, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

Uses Software

• SCIP
• MIPLIB
• MIPLIB2003

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shift-and-propagate
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• Experiments with conflict analysis in mixed integer programming
• Information-based branching schemes for binary linear mixed integer problems
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• MIPLIB 2003
• Conflict analysis in mixed integer programming
• Efficient Intelligent Backtracking Using Linear Programming
• An Automatic Method of Solving Discrete Programming Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• A Computational Study of Search Strategies for Mixed Integer Programming
• A tree-search algorithm for mixed integer programming problems
• Experiments in mixed-integer linear programming