Alexander Martin
Orcid: 0000-0001-7602-3653Affiliations:
- 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 76 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems.
INFORMS J. Comput., 2024
2023
SIAM J. Optim., December, 2023
INFORMS J. Comput., 2023
2022
Exploiting complete linear descriptions for decentralized power market problems with integralities.
Math. Methods Oper. Res., 2022
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty.
Eur. J. Oper. Res., 2022
2021
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
2020
EURO J. Comput. Optim., 2020
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020
2019
HMD Prax. Wirtsch., 2019
2018
Networks, 2018
MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems.
Comput. Optim. Appl., 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
Math. Methods Oper. Res., 2017
Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2017
2016
Transmission and generation investment in electricity markets: The effects of market splitting and network fee regimes.
Eur. J. Oper. Res., 2016
Discret. Optim., 2016
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2016
2015
Validation of nominations in gas network optimization: models, methods, and solutions.
Optim. Methods Softw., 2015
Math. Program. Comput., 2015
Proceedings of the Evaluating Gas Network Capacities, 2015
Proceedings of the Evaluating Gas Network Capacities, 2015
2014
Optim. Methods Softw., 2014
2013
Proceedings of the Operations Research Proceedings 2013, 2013
2012
SIAM J. Optim., 2012
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.
Math. Program. Comput., 2012
2011
Math. Methods Oper. Res., 2011
INFORMS J. Comput., 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Optim. Methods Softw., 2010
Proceedings of the Algorithms, 2010
2009
Efficient reformulation and solution of a nonlinear PDE-controlled flow network model.
Computing, 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations.
SIAM J. Sci. Comput., 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
2007
Math. Methods Oper. Res., 2007
2006
Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks.
SIAM J. Optim., 2006
Math. Program., 2006
Math. Methods Oper. Res., 2006
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
Proceedings of the ATMOS 2006, 2006
2005
Proceedings of the Operations Research Proceedings 2005, 2005
Proceedings of the Operations Research Proceedings 2005, 2005
2004
Proceedings of the Operations Research, 2004
2003
Proceedings of the Modeling, 2003
2002
2001
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.
Proceedings of the Computational Combinatorial Optimization, 2001
2000
1999
Oper. Res., 1999
1998
Math. Program., 1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
1996
Math. Program., 1996
Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996
1995
1994
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program., 1994
1993
ZOR Methods Model. Oper. Res., 1993
1992