Ambros M. Gleixner

Orcid: 0000-0003-0391-5903

Affiliations:
  • HTW Berlin, Germany
  • Zuse Institute Berlin, Germany (former)


According to our database1, Ambros M. Gleixner authored at least 52 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The MIP Workshop 2023 Computational Competition on reoptimization.
Math. Program. Comput., June, 2024

Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework.
SIAM J. Optim., March, 2024

Branch-and-Price for the Length-Constrained Cycle Partition Problem.
CoRR, 2024

Branch and Cut for Partitioning a Graph into a Cycle of Clusters.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2023
A computational study of perspective cuts.
Math. Program. Comput., December, 2023

Enabling Research through the SCIP Optimization Suite 8.0.
ACM Trans. Math. Softw., June, 2023

A computational status update for exact rational mixed integer programming.
Math. Program., February, 2023

PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support.
INFORMS J. Comput., 2023

Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows.
CoRR, 2023

Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization.
CoRR, 2023

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Online Learning for Scheduling MIP Heuristics.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture.
ACM Trans. Math. Softw., 2022

Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices.
Parallel Comput., 2022

On generalized surrogate duality in mixed-integer nonlinear programming.
Math. Program., 2022

A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models.
Eur. J. Oper. Res., 2022

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights.
CoRR, 2022

An algorithm-independent measure of progress for linear constraint propagation.
Constraints An Int. J., 2022

2021
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

Conflict-Driven Heuristics for Mixed Integer Programming.
INFORMS J. Comput., 2021

Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search.
Constraints An Int. J., 2021


Learning to Schedule Heuristics in Branch and Bound.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms.
SIAM J. Optim., 2020

Linear programming using limited-precision oracles.
Math. Program., 2020

On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm.
J. Glob. Optim., 2020

Two-row and two-column mixed-integer presolve using hashing-based pairing methods.
EURO J. Comput. Optim., 2020

Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition.
Ann. Oper. Res., 2020

2019
Solving quadratic programs to high precision using scaled iterative refinement.
Math. Program. Comput., 2019

QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework.
Optim. Methods Softw., 2018

Preface.
Optim. Methods Softw., 2018

Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes.
Multiscale Model. Simul., 2018

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081).
Dagstuhl Reports, 2018

2017
Three enhancements for optimization-based bound tightening.
J. Glob. Optim., 2017

Exact Methods for Recursive Circle Packing.
CoRR, 2017

Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods.
Proceedings of the Operations Research Proceedings 2017, 2017

Verifying Integer Programming Results.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Iterative Refinement for Linear Programming.
INFORMS J. Comput., 2016

Mixed-Integer Programming for Cycle Detection in Non-reversible Markov Processes.
CoRR, 2016

Towards an Accurate Solution of Wireless Network Design Problems.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Branching on Multi-aggregated Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
Undercover: a primal MINLP heuristic exploring a largest sub-MIP.
Math. Program., 2014

2013
Undercover Branching.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Improving the accuracy of linear programming solvers with iterative refinement.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
MIPLIB 2010.
Math. Program. Comput., 2011

2009
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity.
Comput. Oper. Res., 2009

Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling.
Proceedings of the Modeling, 2009


  Loading...