Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization

DOI10.1007/978-3-319-89920-6_21zbMath1397.90283arXiv1803.03455OpenAlexW2962679072MaRDI QIDQ4685751

Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy

Publication date: 9 October 2018

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

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

zbMATH Keywords

linear programmingmixed integer programmingalgorithm analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

An algorithm-independent measure of progress for linear constraint propagation

Uses Software

• SCIP
• MIPLIB
• MIPLIB2003

Cites Work

• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• A relax-and-cut framework for Gomory mixed-integer cuts
• MIPLIB 2003
• Condition
• Integer Programming
• Accuracy and Stability of Numerical Algorithms

This page was built for publication: Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization