Computational aspects of infeasibility analysis in mixed integer programming

DOI10.1007/s12532-021-00202-0zbMath1483.90088OpenAlexW3002903645MaRDI QIDQ2063195

Timo Berthold, Jakob Witzig, Stefan Heinz

Publication date: 10 January 2022

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-021-00202-0

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Uses Software

• SCIP
• XPRESS
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shift-and-propagate
• A system to evaluate gas network capacities: concepts and implementation
• Valid inequalities for mixed integer linear programs
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27--31, 2009. Proceedings
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Experiments with conflict analysis in mixed integer programming
• Information-based branching schemes for binary linear mixed integer problems
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Local rapid learning for integer programs
• A status report on conflict analysis in mixed integer nonlinear programming
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Conflict analysis in mixed integer programming
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Efficient Intelligent Backtracking Using Linear Programming
• Combination of Nonlinear and Linear Optimization of Transient Gas Networks
• Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling
• An Automatic Method of Solving Discrete Programming Problems
• Presolve Reductions in Mixed Integer Programming
• Rapid Learning for Binary Programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• GRASP: a search algorithm for propositional satisfiability
• Parallelization of the FICO Xpress-Optimizer
• Structure-Based Decomposition for Pattern-Detection for Railway Timetables
• Conflict Analysis for MINLP
• Conflict-Driven Heuristics for Mixed Integer Programming
• Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
• Mixed Integer Programming: Analyzing 12 Years of Progress
• A tree-search algorithm for mixed integer programming problems

This page was built for publication: Computational aspects of infeasibility analysis in mixed integer programming