Exploiting Solving Phases for Mixed-Integer Programs

DOI10.1007/978-3-319-42902-1_1MaRDI QIDQ4596186zbMATH OpenOpenAlexFDO

Authors Gregor Hendel

Publication date 1 December 2017

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_1

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• From feasibility to improvement to proof: three phases of solving mixed-integer programs
• Progress in presolving for mixed integer programming
• scientific article; zbMATH DE number 2196290
• Solving a mixed integer program by fathoming dual programs
• Solving multiobjective mixed integer convex optimization problems
• A framework for solving mixed-integer semidefinite programs
• A unified framework for multistage mixed integer linear optimization
• Formulating a Mixed Integer Programming Problem to Improve Solvability
• Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems

Cited in

(3)

• From feasibility to improvement to proof: three phases of solving mixed-integer programs
• Transferring information across restarts in MIP
• Direct phasing by binary integer programming

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Exploiting Solving Phases for Mixed-Integer Programs

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