Andreas Bärmann
Andreas Bärmann
Department of Data Science (DDS)
Lehrstuhl für Analytics & Mixed-Integer Optimization
Cauerstraße 11
91058 Erlangen
- Telefon: +49 9131 85-67159
- Faxnummer: +49 9131 85-67162
- E-Mail: andreas.baermann@math.uni-erlangen.de
- Webseite: https://www.datascience.nat.fau.eu/research/groups/amio/members/andreas-barmann/
Projekte
-
Optimierung von Logistikketten in der Lebensmittelindustrie
(Drittmittelfinanzierte Gruppenförderung – Teilprojekt)
Titel des Gesamtprojektes: SHIELD - Sichere heimische Bio-Lebensmittel durch sensorische Detektionsverfahren
Laufzeit: 01-07-2021 - 30-06-2024
Mittelgeber: Bayerische Forschungsstiftung
URL: https://www.bayfor.org/de/unsere-netzwerke/bayerische-forschungsverbuende/forschungsverbuende/association/shield.htmlAufbauend auf der Expertise der am Projekt beteiligten Industriepartner entwickeln wir mathematische Optimierungsmodelle und Lösungsalgorithmen, die in der Lage sind, die gesamte Logistikkette in den Blick zu nehmen und so effizient wie möglich zu gestalten. Die intelligente Kombination solcher Verfahren mit modernen Methoden der Qualitätssicherung und datengetriebenen Absatzprognosen erlaubt eine Unterstützung der Fachplaner in einem Lebensmittel- oder Handelsunternehmen bei ihren Planungsaufgaben.
-
Process optimization for hospital logistics
(Drittmittelfinanzierte Einzelförderung)
Laufzeit: seit 01-01-2020
Mittelgeber: Industrie
URL: https://en.www.math.fau.de/edom/projects-edom/logistics-and-production/process-optimization-for-hospital-logistics/ -
Reduced Order Modelling, Simulation and Optimization of Coupled systems
(Drittmittelfinanzierte Gruppenförderung – Teilprojekt)
Titel des Gesamtprojektes: Reduced Order Modelling, Simulation and Optimization of Coupled systems
Laufzeit: 01-09-2017 - 31-08-2021
Mittelgeber: EU - 8. Rahmenprogramm - Horizon 2020
URL: https://www.romsoc.eu/
Publikationen
2023
- , , , , :
Algorithms for the clique problem with multiple-choice constraints under a series–parallel dependency graph
In: Discrete Applied Mathematics 324 (2023), S. 145-166
ISSN: 0166-218X
DOI: 10.1016/j.dam.2022.09.015
BibTeX: Download - , , , , :
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming
(2023)
BibTeX: Download - , , , :
Improving Quantum Computation by Optimized Qubit Routing
(2023)
URL: https://arxiv.org/pdf/2206.01294.pdf
BibTeX: Download
2022
- , , , , , , , :
Distributionally Robust Optimization over Time
(2022)
URL: https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/496
BibTeX: Download - , , , :
On Piecewise Linear Approximations of Bilinear Terms: Structural Comparison of Univariate and Bivariate Mixed-Integer Programming Formulations
In: Journal of Global Optimization (2022)
ISSN: 0925-5001
Open Access: https://link.springer.com/article/10.1007/s10898-022-01243-y
URL: http://www.optimization-online.org/DB_HTML/2021/08/8536.html
BibTeX: Download - , , , , :
EETTlib-Energy-efficient train timetabling library
In: Networks (2022)
ISSN: 0028-3045
DOI: 10.1002/net.22117
BibTeX: Download - , , :
Lexicographic Branch-and-Bound Column Search
(2022)
URL: http://www.optimization-online.org/DB_HTML/2022/06/8945.html
BibTeX: Download - Gutina D, Bärmann A, Roeder G, Schellenberger M, Liers F:
Optimisation over Decision Trees – A Case Study for the Design of Stable Direct-Current Electricity Networks
https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/494 (2022)
URL: https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/494
BibTeX: Download
2021
- , , :
Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling
In: Transportation Science 55 (2021), S. 747-767
ISSN: 0041-1655
DOI: 10.1287/trsc.2020.1021
BibTeX: Download - , :
Set characterizations and convex extensions for geometric convex-hull proofs
In: Mathematical Programming (2021)
ISSN: 1436-4646
DOI: 10.1007/s10107-021-01705-3
BibTeX: Download - , , , , , , , :
Analysis and Improvement of LVDC-Grid Stability using Circuit Simulation and Machine Learning - A Case Study
NEIS 2021 Conference on Sustainable Energy Supply
and Energy Storage Systems (Hamburg, 13-09-2021 - 14-09-2021)
BibTeX: Download
2020
- , , :
The clique problem with multiple-choice constraints under a cycle-free dependency graph
In: Discrete Applied Mathematics (2020)
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.12.015
BibTeX: Download
2019
- , , :
Globalized Robust Optimization with Gamma-Uncertainties
(2019)
URL: http://www.optimization-online.org/DB_HTML/2019/06/7253.html
BibTeX: Download
(Techreport)
2018
- :
An Optimal Expansion Strategy for the German Railway Network Until 2030
In: Fink A, Fügenschuh A, Geiger MJ (Hrsg.): Operations Research Proceedings 2016, Cham: 2018
BibTeX: Download - , , , :
Staircase Compatibility and its Applications in Scheduling and Piecewise Linearization
In: Discrete Optimization 29 (2018), S. 111-132
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.04.001
URL: http://www.sciencedirect.com/science/article/pii/S1572528618300306
BibTeX: Download - , :
Aggregation Methods for Railway Network Design Based on Lifted Benders Cuts
In: Borndörfer R, Klug T, Lamorgese L, Mannino C, Reuther M, Schlechte T (Hrsg.): Handbook of Optimization in the Railway Industry, Cham: Springer International Publishing, 2018, S. 47--72
ISBN: 978-3-319-72153-8
DOI: 10.1007/978-3-319-72153-8_3
BibTeX: Download
2017
- , , , , :
Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Computational Management Science, (2016), 13, 2, (151-193), 10.1007/s10287-015-0243-0)
In: Computational Management Science 14 (2017), S. 293-296
ISSN: 1619-697X
DOI: 10.1007/s10287-016-0269-y
BibTeX: Download - , , :
A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation
In: Public Transport 9 (2017), S. 95-113
ISSN: 1613-7159
DOI: 10.1007/s12469-017-0160-4
BibTeX: Download - , , :
A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany
In: Transportation Science (2017)
ISSN: 0041-1655
DOI: 10.1287/trsc.2017.0747
BibTeX: Download - , , :
Emulating the Expert: Inverse Optimization through Online Learning
In: Precup D, Teh YW (Hrsg.): Proceedings of the 34th International Conference on Machine Learning (ICML), International Convention Centre, Sydney, Australia: 2017
URL: http://proceedings.mlr.press/v70/barmann17a.html
BibTeX: Download
2015
- , , , , :
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
In: Computational Management Science 13 (2015), S. 151-193
ISSN: 1619-697X
DOI: 10.1007/s10287-015-0243-0
BibTeX: Download - , , , , , :
Solving Network Design Problems via Iterative Aggregation
In: Mathematical Programming Computation 7 (2015), S. 189-217
ISSN: 1867-2957
DOI: 10.1007/s12532-015-0079-1
BibTeX: Download