42 citations · 88 across the 3 of their papers we have counts for
3 papers
Linear Programming using Limited-Precision Oracles
Ambros Gleixner, Daniel E. Steffy
Since the elimination algorithm of Fourier and Motzkin, many different methods have been developed for solving linear programs. When analyzing the time complexity of LP algorithms,…
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
Matthias Miltenberger, Ted Ralphs, Daniel E. Steffy
We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of…
Verifying Integer Programming Results
Kevin K. H. Cheung, Ambros Gleixner, Daniel E. Steffy
Software for mixed-integer linear programming can return incorrect results for a number of reasons, one being the use of inexact floating-point arithmetic. Even solvers that employ…