Alexander Martin

  • University of Erlangen-Nuremberg, Department of Mathematics, Germany
  • TU Darmstadt, Germany (former)
  • Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany (former)
  • University of Augsburg, Germany (PhD 1992)

According to our database1, Alexander Martin authored at least 71 papers between 1992 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty.
Eur. J. Oper. Res., 2022

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

Time-Domain Decomposition for Optimal Control Problems Governed by Semilinear Hyperbolic Systems.
SIAM J. Control. Optim., 2021

Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks.
J. Glob. Optim., 2021

Portfolio optimization with irreversible long-term investments in renewable energy under policy risk: A mixed-integer multistage stochastic model and a moving-horizon approach.
Eur. J. Oper. Res., 2021

Two-row and two-column mixed-integer presolve using hashing-based pairing methods.
EURO J. Comput. Optim., 2020

AutoIoT: a framework based on user-driven MDE for generating IoT applications.
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

Vorhersage von Ersatzteilbedarfen mit Hilfe von Clusteringverfahren.
HMD Prax. Wirtsch., 2019

Towards simulation based mixed-integer optimization with differential equations.
Networks, 2018

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

MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems.
Comput. Optim. Appl., 2018

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

Pricing and clearing combinatorial markets with singleton and swap orders.
Math. Methods Oper. Res., 2017

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

Transmission and generation investment in electricity markets: The effects of market splitting and network fee regimes.
Eur. J. Oper. Res., 2016

Binary Steiner trees: Structural results and an exact solution approach.
Discret. Optim., 2016

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

Validation of nominations in gas network optimization: models, methods, and solutions.
Optim. Methods Softw., 2015

Progress in presolving for mixed integer programming.
Math. Program. Comput., 2015

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

Chapter 6: The MILP-relaxation approach.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 5: Mathematical optimization for evaluating gas network capacities.
Proceedings of the Evaluating Gas Network Capacities, 2015

Strict linear prices in non-convex European day-ahead electricity markets.
Optim. Methods Softw., 2014

Welfare Maximization of Autarkic Hybrid Energy Systems.
Proceedings of the Operations Research Proceedings 2013, 2013

Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design.
SIAM J. Optim., 2012

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.
Math. Program. Comput., 2012

Mixed integer linear models for the optimization of dynamical transport networks.
Math. Methods Oper. Res., 2011

Combination of Nonlinear and Linear Optimization of Transient Gas Networks.
INFORMS J. Comput., 2011

Quantified Linear Programs: A Computational Study.
Proceedings of the Algorithms - ESA 2011, 2011

A mixed integer approach for time-dependent gas network optimization.
Optim. Methods Softw., 2010

Polyhedral and Algorithmic Properties of Quantified Linear Programs.
Proceedings of the Algorithms, 2010

Efficient reformulation and solution of a nonlinear PDE-controlled flow network model.
Computing, 2009

The Transport PDE and Mixed-Integer Linear Programming.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

Scheduling Locomotives and Car Transfers in Freight Transport.
Transp. Sci., 2008

A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations.
SIAM J. Sci. Comput., 2008

On the Graph Bisection Cut Polytope.
SIAM J. Discret. Math., 2008

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

A simulated annealing algorithm for transient optimization in gas networks.
Math. Methods Oper. Res., 2007

Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks.
SIAM J. Optim., 2006

MIPLIB 2003.
Oper. Res. Lett., 2006

Mixed Integer Models for the Stationary Case of Gas Network Optimization.
Math. Program., 2006

UMTS radio network evaluation and optimization beyond snapshots.
Math. Methods Oper. Res., 2006

A multicriteria approach for optimizing bus schedules and school starting times.
Ann. Oper. Res., 2006

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

Locomotive and Wagon Scheduling in Freight Transport.
Proceedings of the ATMOS 2006, 2006

Branching rules revisited.
Oper. Res. Lett., 2005

Optimization of Sheet Metal Products.
Proceedings of the Operations Research Proceedings 2005, 2005

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem.
Proceedings of the Operations Research Proceedings 2005, 2005

Integrated Optimization of School Starting Times and Public Bus Services.
Proceedings of the Operations Research, 2004

Cutting Planes for the Optimisation of Gas Networks.
Proceedings of the Modeling, 2003

Cutting planes in integer and mixed integer programming.
Discret. Appl. Math., 2002

General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.
Proceedings of the Computational Combinatorial Optimization, 2001

Parallelizing the Dual Simplex Method.
INFORMS J. Comput., 2000

Routing Through Virtual Paths in Layered Telecommunication Networks.
Oper. Res., 1999

Decomposing Matrices into Blocks.
SIAM J. Optim., 1998

Solving Steiner tree problems in graphs to optimality.
Networks, 1998

The node capacitated graph partitioning problem: A computational study.
Math. Program., 1998

Frequency assignment in cellular phone networks.
Ann. Oper. Res., 1998

The Intersection of Knapsack Polyhedra and Extensions.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

The Steiner tree packing problem in VLSI design.
Math. Program., 1997

Solving Multiple Knapsack Problems by Cutting Planes.
SIAM J. Optim., 1996

Packing Steiner Trees: Separation Algorithms.
SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.
Math. Program., 1996

Packing Steiner trees: polyhedral investigations.
Math. Program., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996

Packing Steiner Trees: Further Facets.
Eur. J. Comb., 1996

Routing in grid graphs by cutting planes.
Math. Methods Oper. Res., 1995

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program., 1994

Some integer programs arising in the design of main frame computers.
ZOR Methods Model. Oper. Res., 1993

Packen von Steinerbäumen: polyedrische Studien und Anwendung.
PhD thesis, 1992