Set characterizations and convex extensions for geometric convex-hull proofs von Bärmann, Andreas, Schneider, Oskar

Volltext

A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany von Bärmann, Andreas, Martin, Alexander, Schülldorf, Hanno

Volltext

Solving Network Design Problems Via Decomposition, Aggregation and Approximation von Barmann, Andreas

Volltext

Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study von Bärmann, Andreas, Heidt, Andreas, Martin, Alexander, Pokutta, Sebastian, Thurner, Christoph

Volltext

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study von Bärmann, Andreas, Heidt, Andreas, Martin, Alexander, Pokutta, Sebastian, Thurner, Christoph

Volltext

Optimization over decision trees: a case study for the design of stable direct-current electricity networks von Gutina, Daria, Bärmann, Andreas, Roeder, Georg, Schellenberger, Martin, Liers, Frauke

Volltext

A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport von Bärmann, Andreas, Martin, Alexander, Staszek, Jonasz

Volltext

A Stochastic Optimization Approach to Energy-Efficient Underground Timetabling Under Uncertain Dwell and Running Times von Gemander, Patrick, Bärmann, Andreas, Martin, Alexander

Volltext

An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products von Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kutzer, Katja

Volltext

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints von Bärmann, Andreas, Martin, Alexander, Schneider, Oskar

Volltext

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations von Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kleinert, Thomas

Volltext

Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling von Bärmann, Andreas, Martin, Alexander, Schneider, Oskar

Volltext

On Recognizing Staircase Compatibility von Bärmann, Andreas, Gemander, Patrick, Martin, Alexander, Merkert, Maximilian

Volltext

The clique problem with multiple-choice constraints under a cycle-free dependency graph von Bärmann, Andreas, Gemander, Patrick, Merkert, Maximilian

Volltext

Improving Quantum Computation by Optimized Qubit Routing von Wagner, Friedrich, Bärmann, Andreas, Liers, Frauke, Weissenbäck, Markus

Volltext

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II von Beach, Benjamin, Burlacu, Robert, Bärmann, Andreas, Hager, Lukas, Hildebrand, Robert

Volltext

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I von Beach, Benjamin, Burlacu, Robert, Bärmann, Andreas, Hager, Lukas, Hildebrand, Robert

Volltext

A column generation approach for the lexicographic optimization of intra-hospital transports von Bärmann, Andreas, Martin, Alexander, Müller, Alexander, Weninger, Dieter

Volltext

EETTlib—Energy‐efficient train timetabling library von Bärmann, Andreas, Gemander, Patrick, Hager, Lukas, Nöth, Frederik, Schneider, Oskar

Volltext

Algorithms for the clique problem with multiple-choice constraints under a series–parallel dependency graph von Bärmann, Andreas, Gemander, Patrick, Merkert, Maximilian, Wiertz, Ann-Kathrin, Zaragoza Martínez, Francisco Javier

Volltext