default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Bärmann
Person information
- affiliation: Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. Comput. Optim. Appl. 87(3): 835-891 (2024)- [j18]Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. Comput. Optim. Appl. 87(3): 893-934 (2024) - 2023
- [j17]Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez:
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. Discret. Appl. Math. 324: 145-166 (2023) - [j16]Kevin-Martin Aigner, Andreas Bärmann, Kristin Braun, Frauke Liers, Sebastian Pokutta, Oskar Schneider, Kartikey Sharma, Sebastian Tschuppik:
Data-Driven Distributionally Robust Optimization over Time. INFORMS J. Optim. 5(4): 376-394 (2023) - [j15]Andreas Bärmann, Robert Burlacu, Lukas Hager, Thomas Kleinert:
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations. J. Glob. Optim. 85(4): 789-819 (2023) - [j14]Friedrich Wagner, Andreas Bärmann, Frauke Liers, Markus Weissenbäck:
Improving Quantum Computation by Optimized Qubit Routing. J. Optim. Theory Appl. 197(3): 1161-1194 (2023) - [j13]Andreas Bärmann, Robert Burlacu, Lukas Hager, Katja Kutzer:
An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products. J. Optim. Theory Appl. 199(2): 569-599 (2023) - [j12]Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider:
EETTlib - Energy-efficient train timetabling library. Networks 81(1): 51-74 (2023) - [j11]Andreas Bärmann, Alexander Martin, Oskar Schneider:
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints. SIAM J. Optim. 33(4): 2909-2934 (2023) - 2022
- [j10]Andreas Bärmann, Patrick Gemander, Alexander Martin, Maximilian Merkert:
On Recognizing Staircase Compatibility. J. Optim. Theory Appl. 195(2): 449-479 (2022) - [j9]Andreas Bärmann, Oskar Schneider:
Set characterizations and convex extensions for geometric convex-hull proofs. Math. Program. 195(1): 475-515 (2022) - 2021
- [j8]Andreas Bärmann, Alexander Martin, Oskar Schneider:
Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling. Transp. Sci. 55(3): 747-767 (2021) - 2020
- [j7]Andreas Bärmann, Patrick Gemander, Maximilian Merkert:
The clique problem with multiple-choice constraints under a cycle-free dependency graph. Discret. Appl. Math. 283: 59-77 (2020)
2010 – 2019
- 2018
- [j6]Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider:
Staircase compatibility and its applications in scheduling and piecewise linearization. Discret. Optim. 29: 111-132 (2018) - [i1]Andreas Bärmann, Alexander Martin, Sebastian Pokutta, Oskar Schneider:
An Online-Learning Approach to Inverse Optimization. CoRR abs/1810.12997 (2018) - 2017
- [j5]Andreas Bärmann, Andreas Heidt, Alexander Martin, Sebastian Pokutta, Christoph Thurner:
Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. Comput. Manag. Sci. 14(2): 293-296 (2017) - [j4]Andreas Bärmann, Alexander Martin, Oskar Schneider:
A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation. Public Transp. 9(1-2): 95-113 (2017) - [j3]Andreas Bärmann, Alexander Martin, Hanno Schülldorf:
A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany. Transp. Sci. 51(4): 1102-1121 (2017) - [c2]Andreas Bärmann, Sebastian Pokutta, Oskar Schneider:
Emulating the Expert: Inverse Optimization through Online Learning. ICML 2017: 400-410 - 2016
- [j2]Andreas Bärmann, Andreas Heidt, Alexander Martin, Sebastian Pokutta, Christoph Thurner:
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. Comput. Manag. Sci. 13(2): 151-193 (2016) - [c1]Andreas Bärmann:
An Optimal Expansion Strategy for the German Railway Network Until 2030. OR 2016: 3-8 - 2015
- [j1]Andreas Bärmann, Frauke Liers, Alexander Martin, Maximilian Merkert, Christoph Thurner, Dieter Weninger:
Solving network design problems via iterative aggregation. Math. Program. Comput. 7(2): 189-217 (2015)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-06-10 20:27 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:
