Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
From MaRDI portal
Publication:4685751
DOI10.1007/978-3-319-89920-6_21zbMath1397.90283arXiv1803.03455MaRDI 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
65K05: Numerical mathematical programming methods
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Uses Software
Cites Work