Andreas Bärmann

Orcid: 0000-0001-8636-4478

Affiliations:
  • Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany


According to our database1, Andreas Bärmann authored at least 22 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II.
Comput. Optim. Appl., April, 2024

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I.
Comput. Optim. Appl., April, 2024

2023
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints.
SIAM J. Optim., December, 2023

An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products.
J. Optim. Theory Appl., November, 2023

Data-Driven Distributionally Robust Optimization over Time.
INFORMS J. Optim., October, 2023

Improving Quantum Computation by Optimized Qubit Routing.
J. Optim. Theory Appl., June, 2023

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations.
J. Glob. Optim., April, 2023

EETTlib - Energy-efficient train timetabling library.
Networks, January, 2023

Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph.
Discret. Appl. Math., 2023

2022
Set characterizations and convex extensions for geometric convex-hull proofs.
Math. Program., 2022

On Recognizing Staircase Compatibility.
J. Optim. Theory Appl., 2022

2021
Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling.
Transp. Sci., 2021

2020
The clique problem with multiple-choice constraints under a cycle-free dependency graph.
Discret. Appl. Math., 2020

2018
Staircase compatibility and its applications in scheduling and piecewise linearization.
Discret. Optim., 2018

An Online-Learning Approach to Inverse Optimization.
CoRR, 2018

2017
A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany.
Transp. Sci., 2017

A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation.
Public Transp., 2017

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2017

Emulating the Expert: Inverse Optimization through Online Learning.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2016

An Optimal Expansion Strategy for the German Railway Network Until 2030.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015
Solving network design problems via iterative aggregation.
Math. Program. Comput., 2015


  Loading...