Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmbros M. Gleixner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Leon Eifler
, Ambros M. Gleixner:
A computational status update for exact rational mixed integer programming. Math. Program. 197(2): 793-812 (2023)- [c18]Antonia Chmiela, Ambros M. Gleixner, Pawel Lichocki, Sebastian Pokutta:
Online Learning for Scheduling MIP Heuristics. CPAIOR 2023: 114-123 - [c17]Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg:
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. IPCO 2023: 14-28 - [i10]Antonia Chmiela, Ambros M. Gleixner, Pawel Lichocki, Sebastian Pokutta:
Online Learning for Scheduling MIP Heuristics. CoRR abs/2304.03755 (2023) - 2022
- [j23]Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
An algorithm-independent measure of progress for linear constraint propagation. Constraints An Int. J. 27(4): 432-455 (2022) - [j22]Daniel Rehfeldt, Hannes Hobbie, David Schönheit, Thorsten Koch, Dominik Möst, Ambros M. Gleixner:
A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models. Eur. J. Oper. Res. 296(1): 60-71 (2022) - [j21]Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On generalized surrogate duality in mixed-integer nonlinear programming. Math. Program. 192(1): 89-118 (2022) - [j20]Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices. Parallel Comput. 109: 102874 (2022) - [j19]Leon Eifler, Ambros M. Gleixner, Jonad Pulaj:
A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture. ACM Trans. Math. Softw. 48(2): 14:1-14:12 (2022) - [i9]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, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. CoRR abs/2203.02433 (2022) - 2021
- [j18]Jo Devriendt, Ambros M. Gleixner, Jakob Nordström:
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search. Constraints An Int. J. 26(1): 26-55 (2021) - [j17]Jakob Witzig, Ambros M. Gleixner:
Conflict-Driven Heuristics for Mixed Integer Programming. INFORMS J. Comput. 33(2): 706-720 (2021) - [j16]Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - [c16]Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. CP 2021: 52:1-52:17 - [c15]Leon Eifler, Ambros M. Gleixner:
A Computational Status Update for Exact Rational Mixed Integer Programming. IPCO 2021: 163-177 - [c14]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, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. NeurIPS (Competition and Demos) 2021: 220-231 - [c13]Antonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi, Sebastian Pokutta:
Learning to Schedule Heuristics in Branch and Bound. NeurIPS 2021: 24235-24246 - [i8]Antonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi, Sebastian Pokutta:
Learning to Schedule Heuristics in Branch-and-Bound. CoRR abs/2103.10294 (2021) - 2020
- [j15]Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso:
Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. Ann. Oper. Res. 284(2): 527-555 (2020) - [j14]Patrick Gemander, Weikun Chen, Dieter Weninger, Leona Gottwald, Ambros M. Gleixner, Alexander Martin:
Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO J. Comput. Optim. 8(3): 205-240 (2020) - [j13]Felipe Serrano, Robert Schwarz, Ambros M. Gleixner:
On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm. J. Glob. Optim. 78(1): 161-179 (2020) - [j12]Ambros M. Gleixner, Daniel E. Steffy:
Linear programming using limited-precision oracles. Math. Program. 183(1): 525-554 (2020) - [j11]Benjamin Müller, Felipe Serrano, Ambros M. Gleixner:
Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms. SIAM J. Optim. 30(2): 1339-1365 (2020) - [c12]Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming. IPCO 2020: 322-337 - [c11]Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
Accelerating Domain Propagation: An Efficient GPU-Parallel Algorithm over Sparse Matrices. IA3@SC 2020: 1-11 - [i7]Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta:
Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse Matrices. CoRR abs/2009.07785 (2020)
2010 – 2019
- 2019
- [j10]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [j9]Tobias Weber, Sebastian Sager, Ambros M. Gleixner:
Solving quadratic programs to high precision using scaled iterative refinement. Math. Program. Comput. 11(3): 421-455 (2019) - [c10]Ambros M. Gleixner, Daniel E. Steffy:
Linear Programming Using Limited-Precision Oracles. IPCO 2019: 399-412 - [c9]Ambros M. Gleixner, Nils-Christian Kempke, Thorsten Koch, Daniel Rehfeldt, Svenja Uslu:
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method. OR 2019: 105-111 - [i6]Ambros M. Gleixner, Daniel E. Steffy:
Linear Programming using Limited-Precision Oracles. CoRR abs/1912.12820 (2019) - 2018
- [j8]Jakob Witzig, Isabel Beckenbach, Leon Eifler, Konstantin Fackeldey, Ambros M. Gleixner, Andreas Grever, Marcus Weber:
Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes. Multiscale Model. Simul. 16(1): 248-265 (2018) - [j7]Ambros M. Gleixner, Christian Kirches, John Mitchell, Theodore K. Ralphs:
Preface. Optim. Methods Softw. 33(3): 419 (2018) - [j6]Stefan Vigerske, Ambros M. Gleixner:
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3): 563-593 (2018) - [i5]Pierre Bonami, Ambros M. Gleixner, Jeff T. Linderoth, Ruth Misener:
Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). Dagstuhl Reports 8(2): 64-87 (2018) - 2017
- [j5]Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge:
Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67(4): 731-757 (2017) - [c8]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. IPCO 2017: 148-160 - [c7]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:
Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods. OR 2017: 641-647 - [i4]Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso:
Exact Methods for Recursive Circle Packing. CoRR abs/1702.07799 (2017) - 2016
- [j4]Ambros M. Gleixner, Daniel E. Steffy, Kati Wolter:
Iterative Refinement for Linear Programming. INFORMS J. Comput. 28(3): 449-464 (2016) - [c6]Fabio D'Andreagiovanni, Ambros M. Gleixner:
Towards an Accurate Solution of Wireless Network Design Problems. ISCO 2016: 135-147 - [i3]Fabio D'Andreagiovanni, Ambros M. Gleixner:
Towards an accurate solution of wireless network design problems. CoRR abs/1604.00513 (2016) - [i2]Isabel Beckenbach, Leon Eifler, Konstantin Fackeldey, Ambros M. Gleixner, Andreas Grever, Marcus Weber, Jakob Witzig:
Mixed-Integer Programming for Cycle Detection in Non-reversible Markov Processes. CoRR abs/1609.02063 (2016) - [i1]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. CoRR abs/1611.08832 (2016) - 2015
- [c5]Gerald Gamrath, Anna Melchiori, Timo Berthold, Ambros M. Gleixner, Domenico Salvagnin:
Branching on Multi-aggregated Variables. CPAIOR 2015: 141-156 - 2014
- [j3]Timo Berthold, Ambros M. Gleixner:
Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144(1-2): 315-346 (2014) - 2013
- [c4]Ambros M. Gleixner, Stefan Weltge:
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming. CPAIOR 2013: 355-361 - [c3]Timo Berthold, Ambros M. Gleixner:
Undercover Branching. SEA 2013: 212-223 - 2012
- [c2]Ambros M. Gleixner, Daniel E. Steffy, Kati Wolter:
Improving the accuracy of linear programming solvers with iterative refinement. ISSAC 2012: 187-194 - 2011
- [j2]Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011)
2000 – 2009
- 2009
- [j1]Natashia Boland, Irina Dumitrescu, Gary Froyland, Ambros M. Gleixner:
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Comput. Oper. Res. 36(4): 1064-1089 (2009) - [c1]Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske:
Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. HPSC 2009: 25-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-06-05 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
