Four Good Reasons to Use an Interior Point Solver Within a MIP Solver

DOI10.1007/978-3-319-89920-6_22zbMath1397.90278OpenAlexW2746454974MaRDI QIDQ4685752

Timo Berthold, Csaba Meszaros, Michael Perregaard

Publication date: 9 October 2018

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

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_22

zbMATH Keywords

barrier methodmixed integer programminganalytic centerinterior point

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)

Related Items

Cutting plane selection with analytic centers and multiregression, A \(J\)-symmetric quasi-Newton method for minimax problems, Structure-driven fix-and-propagate heuristics for mixed integer programming

Uses Software

• BPMPD
• MIPLIB
• FEASPUMP
• XPRESS
• ACCPM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive central rounding for mixed integer programs
• Using the analytic center in the feasibility pump
• Boosting the feasibility pump
• Proximity search for 0--1 mixed-integer convex programming
• A new polynomial-time algorithm for linear programming
• Applications of the notion of analytic center in approximation (estimation) problems
• A first look at picking dual variables for maximizing reduced cost fixing
• Measuring the impact of primal heuristics
• The feasibility pump
• Parallelization of the FICO Xpress-Optimizer
• Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An In-Out Approach to Disjunctive Optimization
• On constrained optimization by adjoint based quasi-Newton methods
• The BPMPD interior point solver for convex quadratic problems