Andreas Bärmann

From MaRDI portal
Person:1662649

Available identifiers

zbMath Open barmann.andreasMaRDI QIDQ1662649

List of research outcomes





PublicationDate of PublicationType
EETTlib—Energy‐efficient train timetabling library2023-12-18Paper
Optimization over decision trees: a case study for the design of stable direct-current electricity networks2023-11-16Paper
An approximation algorithm for optimal piecewise linear interpolations of bounded variable products2023-11-09Paper
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints2023-11-03Paper
Improving quantum computation by optimized qubit routing2023-07-07Paper
Data-driven Distributionally Robust Optimization over Time2023-04-11Paper
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations2023-04-03Paper
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II2023-02-02Paper
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph2022-11-11Paper
On recognizing staircase compatibility2022-11-07Paper
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I2022-11-02Paper
Energy-efficient timetabling in a German underground system2022-10-25Paper
Set characterizations and convex extensions for geometric convex-hull proofs2022-10-24Paper
The clique problem with multiple-choice constraints under a cycle-free dependency graph2020-06-29Paper
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study2018-10-10Paper
Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study2018-10-10Paper
Staircase compatibility and its applications in scheduling and piecewise linearization2018-08-20Paper
An Optimal Expansion Strategy for the German Railway Network Until 20302017-12-01Paper
Solving Network Design Problems via Decomposition, Aggregation and Approximation2016-05-04Paper
Solving network design problems via iterative aggregation2015-07-31Paper

Research outcomes over time

This page was built for person: Andreas Bärmann