Andreas Bärmann

zbMath Openbarmann.andreasMaRDI QIDQ1662649

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
EETTlib—Energy‐efficient train timetabling library Networks	2023-12-18	Paper
Optimization over decision trees: a case study for the design of stable direct-current electricity networks Optimization and Engineering	2023-11-16	Paper
An approximation algorithm for optimal piecewise linear interpolations of bounded variable products Journal of Optimization Theory and Applications	2023-11-09	Paper
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints SIAM Journal on Optimization	2023-11-03	Paper
Improving quantum computation by optimized qubit routing Journal of Optimization Theory and Applications	2023-07-07	Paper
Data-driven Distributionally Robust Optimization over Time	2023-04-11	Paper
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations Journal of Global Optimization	2023-04-03	Paper
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II	2023-02-02	Paper
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph Discrete Applied Mathematics	2022-11-11	Paper
On recognizing staircase compatibility Journal of Optimization Theory and Applications	2022-11-07	Paper
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I	2022-11-02	Paper
Energy-efficient timetabling in a German underground system	2022-10-25	Paper
Set characterizations and convex extensions for geometric convex-hull proofs Mathematical Programming. Series A. Series B	2022-10-24	Paper
The clique problem with multiple-choice constraints under a cycle-free dependency graph Discrete Applied Mathematics	2020-06-29	Paper
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study Computational Management Science	2018-10-10	Paper
Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study Computational Management Science	2018-10-10	Paper
Staircase compatibility and its applications in scheduling and piecewise linearization Discrete Optimization	2018-08-20	Paper
An optimal expansion strategy for the German railway network until 2030 Operations Research Proceedings 2016	2017-12-01	Paper
Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure	2016-05-04	Paper
Solving network design problems via iterative aggregation Mathematical Programming Computation	2015-07-31	Paper

Research outcomes over time

This page was built for person: Andreas Bärmann