67 citations · 151 across the 41 of their papers we have counts for
6 papers · 1 filter
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,…
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
Benjamin Müller, Gonzalo Muñoz, Maxime Gasse +3
The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global epsilon-optimality with spatial branch and bound is a tight, computationally tractable…
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method
Ambros Gleixner, Nils-Christian Kempke, Thorsten Koch +2
In linear optimization, matrix structure can often be exploited algorithmically. However, beneficial presolving reductions sometimes destroy the special structure of a given proble…
On the Relation between the Extended Supporting Hyperplane Algorithm and Kelley's Cutting Plane Algorithm
Felipe Serrano, Robert Schwarz, Ambros Gleixner
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational b…
Using two-dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
Benjamin Müller, Felipe Serrano, Ambros Gleixner
One of the most fundamental ingredients in mixed-integer nonlinear programming solvers is the well-known McCormick relaxation for a product of two variables x and y over a box-cons…
Conflict-Driven Heuristics for Mixed Integer Programming
Jakob Witzig, Ambros Gleixner
Two essential ingredients of modern mixed-integer programming (MIP) solvers are diving heuristics that simulate a partial depth-first search in a branch-and-bound search tree and c…