Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. - Andreas Bley; Ambros M. Gleixner; Thorsten Koch; Stefan Vigerske (HPSC, 2009)

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. - Natashia Boland; Irina Dumitrescu; Gary Froyland; Ambros M. Gleixner (Comput. Oper. Res., 2009)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

Improving the accuracy of linear programming solvers with iterative refinement. - Ambros M. Gleixner; Daniel E. Steffy; Kati Wolter (ISSAC, 2012)

Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming. - Ambros M. Gleixner; Stefan Weltge (CPAIOR, 2013)

Undercover Branching. - Timo Berthold; Ambros M. Gleixner (SEA, 2013)

Undercover: a primal MINLP heuristic exploring a largest sub-MIP. - Timo Berthold; Ambros M. Gleixner (Math. Program., 2014)

Branching on Multi-aggregated Variables. - Gerald Gamrath; Anna Melchiori; Timo Berthold; Ambros M. Gleixner; Domenico Salvagnin (CPAIOR, 2015)

Towards an Accurate Solution of Wireless Network Design Problems. - Fabio D'Andreagiovanni; Ambros M. Gleixner (ISCO, 2016)

Mixed-Integer Programming for Cycle Detection in Non-reversible Markov Processes. - Isabel Beckenbach; Leon Eifler; Konstantin Fackeldey; Ambros M. Gleixner; Andreas Grever; Marcus Weber; Jakob Witzig (CoRR, 2016)

Iterative Refinement for Linear Programming. - Ambros M. Gleixner; Daniel E. Steffy; Kati Wolter (INFORMS J. Comput., 2016)

Verifying Integer Programming Results. - Kevin K. H. Cheung; Ambros M. Gleixner; Daniel E. Steffy (IPCO, 2017)

Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods. - Thomas Breuer; Michael R. Bussieck; Karl-Kiên Cao; Felix Cebulla; Frederik Fiand; Hans Christian Gils; Ambros M. Gleixner; Dmitry Khabi; Thorsten Koch; Daniel Rehfeldt; Manuel Wetzel (OR, 2017)

Exact Methods for Recursive Circle Packing. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (CoRR, 2017)

Three enhancements for optimization-based bound tightening. - Ambros M. Gleixner; Timo Berthold; Benjamin Müller 002; Stefan Weltge (J. Glob. Optim., 2017)

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). - Pierre Bonami; Ambros M. Gleixner; Jeff T. Linderoth; Ruth Misener (Dagstuhl Reports, 2018)

Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes. - Jakob Witzig; Isabel Beckenbach; Leon Eifler; Konstantin Fackeldey; Ambros M. Gleixner; Andreas Grever; Marcus Weber (Multiscale Model. Simul., 2018)

Preface. - Ambros M. Gleixner; Christian Kirches; John Mitchell; Theodore K. Ralphs (Optim. Methods Softw., 2018)

SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. - Stefan Vigerske; Ambros M. Gleixner (Optim. Methods Softw., 2018)

First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method. - Ambros M. Gleixner; Nils-Christian Kempke; Thorsten Koch; Daniel Rehfeldt; Svenja Uslu (OR, 2019)

QPLIB: a library of quadratic programming instances. - Fabio Furini; Emiliano Traversi; Pietro Belotti; Antonio Frangioni; Ambros M. Gleixner; Nick Gould; Leo Liberti; Andrea Lodi 001; Ruth Misener; Hans D. Mittelmann; Nikolaos V. Sahinidis; Stefan Vigerske; et al. (Math. Program. Comput., 2019)

Solving quadratic programs to high precision using scaled iterative refinement. - Tobias Weber; Sebastian Sager; Ambros M. Gleixner (Math. Program. Comput., 2019)

Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (Ann. Oper. Res., 2020)

Two-row and two-column mixed-integer presolve using hashing-based pairing methods. - Patrick Gemander; Weikun Chen; Dieter Weninger; Leona Gottwald; Ambros M. Gleixner; Alexander Martin 001 (EURO J. Comput. Optim., 2020)

On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm. - Felipe Serrano 001; Robert Schwarz; Ambros M. Gleixner (J. Glob. Optim., 2020)

Linear programming using limited-precision oracles. - Ambros M. Gleixner; Daniel E. Steffy (Math. Program., 2020)

Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms. - Benjamin Müller 002; Felipe Serrano 001; Ambros M. Gleixner (SIAM J. Optim., 2020)

Learning to Schedule Heuristics in Branch and Bound. - Antonia Chmiela; Elias B. Khalil; Ambros M. Gleixner; Andrea Lodi 001; Sebastian Pokutta (NeurIPS, 2021)

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. - Maxime Gasse; Simon Bowly; Quentin Cappart; Jonas Charfreitag; Laurent Charlin; Didier Chételat; Antonia Chmiela; Justin Dumouchelle; Ambros M. Gleixner; Aleksandr M. Kazachkov; Elias B. Khalil; Pawel Lichocki; et al. (NeurIPS (Competition and Demos), 2021)

Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search. - Jo Devriendt; Ambros M. Gleixner; Jakob Nordström (Constraints An Int. J., 2021)

Conflict-Driven Heuristics for Mixed Integer Programming. - Jakob Witzig; Ambros M. Gleixner (INFORMS J. Comput., 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

Learning to Schedule Heuristics in Branch-and-Bound. - Antonia Chmiela; Elias B. Khalil; Ambros M. Gleixner; Andrea Lodi 001; Sebastian Pokutta (Zenodo, 2021)

An algorithm-independent measure of progress for linear constraint propagation. - Boro Sofranac; Ambros M. Gleixner; Sebastian Pokutta (Constraints An Int. J., 2022)

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. - Maxime Gasse; Quentin Cappart; Jonas Charfreitag; Laurent Charlin; Didier Chételat; Antonia Chmiela; Justin Dumouchelle; Ambros M. Gleixner; Aleksandr M. Kazachkov; Elias B. Khalil; Pawel Lichocki; Andrea Lodi 001; et al. (CoRR, 2022)

A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models. - Daniel Rehfeldt; Hannes Hobbie; David Schönheit; Thorsten Koch; Dominik Möst; Ambros M. Gleixner (Eur. J. Oper. Res., 2022)

On generalized surrogate duality in mixed-integer nonlinear programming. - Benjamin Müller 002; Gonzalo Muñoz 001; Maxime Gasse; Ambros M. Gleixner; Andrea Lodi 001; Felipe Serrano 001 (Math. Program., 2022)

Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices. - Boro Sofranac; Ambros M. Gleixner; Sebastian Pokutta (Parallel Comput., 2022)

A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture. - Leon Eifler; Ambros M. Gleixner; Jonad Pulaj (ACM Trans. Math. Softw., 2022)

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. - Gioni Mexi; Timo Berthold; Ambros M. Gleixner; Jakob Nordström (CP, 2023)

Online Learning for Scheduling MIP Heuristics. - Antonia Chmiela; Ambros M. Gleixner; Pawel Lichocki; Sebastian Pokutta (CPAIOR, 2023)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. - Ksenia Bestuzheva; Ambros M. Gleixner; Tobias Achterberg (IPCO, 2023)

Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization. - Gioni Mexi; Mathieu Besançon; Suresh Bolusani; Antonia Chmiela; Alexander Hoen; Ambros M. Gleixner (CoRR, 2023)

Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows. - Mohammed Ghannam; Ambros M. Gleixner (CoRR, 2023)

PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support. - Ambros M. Gleixner; Leona Gottwald; Alexander Hoen (INFORMS J. Comput., 2023)

A computational status update for exact rational mixed integer programming. - Leon Eifler; Ambros M. Gleixner (Math. Program., 2023)

Online Learning for Scheduling MIP Heuristics. - Antonia Chmiela; Ambros M. Gleixner; Pawel Lichocki; Sebastian Pokutta (Zenodo, 2023)

Enabling Research through the SCIP Optimization Suite 8.0. - Ksenia Bestuzheva; Mathieu Besançon; Weikun Chen; Antonia Chmiela; Tim Donkiewicz; Jasper van Doornmalen; Leon Eifler; Oliver Gaul; Gerald Gamrath; Ambros M. Gleixner; Leona Gottwald; Christoph Graczyk; et al. (ACM Trans. Math. Softw., 2023)

A computational study of perspective cuts. - Ksenia Bestuzheva; Ambros M. Gleixner; Stefan Vigerske (Math. Program. Comput., 2023)

Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs. - Alexander Hoen; Andy Oertel; Ambros M. Gleixner; Jakob Nordström (CPAIOR (1), 2024)

Branch and Cut for Partitioning a Graph into a Cycle of Clusters. - Leon Eifler; Jakob Witzig; Ambros M. Gleixner (ISCO, 2024)

Branch-and-Price for the Length-Constrained Cycle Partition Problem. - Mohammed Ghannam; Gioni Mexi; Edward Lam 001; Ambros M. Gleixner (CoRR, 2024)

Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework. - Leon Eifler; Ambros M. Gleixner (SIAM J. Optim., 2024)

The MIP Workshop 2023 Computational Competition on reoptimization. - Suresh Bolusani; Mathieu Besançon; Ambros M. Gleixner; Timo Berthold; Claudia D'Ambrosio; Gonzalo Muñoz 001; Joseph Paat; Dimitri Thomopulos (Math. Program. Comput., 2024)

Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming. - Alexander Hoen; Ambros M. Gleixner (CPAIOR (2), 2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables. - Katrin Halbig; Alexander Hoen; Ambros M. Gleixner; Jakob Witzig; Dieter Weninger (EURO J. Comput. Optim., 2025)

Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization. - Leon Eifler; Jules Nicolas-Thouvenin; Ambros M. Gleixner (INFORMS J. Comput., 2025)

Efficient separation of RLT cuts for implicit and explicit bilinear terms. - Ksenia Bestuzheva; Ambros M. Gleixner; Tobias Achterberg (Math. Program., 2025)