default search action
Alexander Martin 0001
Person information
- affiliation: University of Erlangen-Nuremberg, Department of Mathematics, Germany
- affiliation (former): TU Darmstadt, Germany
- affiliation (former): Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany
- affiliation (PhD 1992): University of Augsburg, Germany
Other persons with the same name
- Alexander Martin 0002 — Center for Genetic Engineering and Biotechnology, Havana, Cuba
- Alexander Martin 0003
— University of Edinburgh, Centre for Language Evolution, UK (and 1 more)
- Alexander Martin 0004 — Michigan Technological University, Houghton, MI, USA
- Alexander Martin 0005 — GlobalFounrdries, Malta, NY, USA
- Alexander Martin 0006
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j58]Richard Krug, Günter Leugering, Alexander Martin, Martin Schmidt
A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems. INFORMS J. Comput. 36(2): 397-416 (2024) - 2023
- [j57]Kevin-Martin Aigner
Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality. INFORMS J. Comput. 35(2): 458-474 (2023) - [j56]Andreas Bärmann, Alexander Martin, Oskar Schneider:
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints. SIAM J. Optim. 33(4): 2909-2934 (2023) - 2022
- [j55]Kevin-Martin Aigner
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty. Eur. J. Oper. Res. 301(1): 318-333 (2022) - [j54]Andreas Bärmann
On Recognizing Staircase Compatibility. J. Optim. Theory Appl. 195(2): 449-479 (2022) - [j53]Lukas Hümbs
Exploiting complete linear descriptions for decentralized power market problems with integralities. Math. Methods Oper. Res. 95(3): 451-474 (2022) - 2021
- [j52]Nadine Gatzert, Alexander Martin, Martin Schmidt, Benjamin Seith, Nikolai Vogl:
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. 290(2): 734-748 (2021) - [j51]Frauke Liers
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80(2): 307-340 (2021) - [j50]Richard Krug, Günter Leugering
Time-Domain Decomposition for Optimal Control Problems Governed by Semilinear Hyperbolic Systems. SIAM J. Control. Optim. 59(6): 4339-4372 (2021) - [j49]Andreas Bärmann
Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling. Transp. Sci. 55(3): 747-767 (2021) - 2020
- [j48]Patrick Gemander
Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO J. Comput. Optim. 8(3): 205-240 (2020) - [c14]Thiago Nepomuceno, Tiago Carneiro
AutoIoT: a framework based on user-driven MDE for generating IoT applications. SAC 2020: 719-728
2010 – 2019
- 2019
- [j47]Christian Menden, Julius Mehringer, Alexander Martin, Michael Amberg:
Vorhersage von Ersatzteilbedarfen mit Hilfe von Clusteringverfahren. HMD Prax. Wirtsch. 56(5): 1000-1016 (2019) - 2018
- [j46]Martin Gugat
MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems. Comput. Optim. Appl. 70(1): 267-294 (2018) - [j45]Martin Gugat
Towards simulation based mixed-integer optimization with differential equations. Networks 72(1): 60-83 (2018) - [i2]Andreas Bärmann, Alexander Martin, Sebastian Pokutta, Oskar Schneider:
An Online-Learning Approach to Inverse Optimization. CoRR abs/1810.12997 (2018) - 2017
- [j44]Andreas Bärmann, Andreas Heidt, Alexander Martin
Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. Comput. Manag. Sci. 14(2): 293-296 (2017) - [j43]Johannes C. Müller, Sebastian Pokutta, Alexander Martin
Pricing and clearing combinatorial markets with singleton and swap orders. Math. Methods Oper. Res. 85(2): 155-177 (2017) - [j42]Andreas Bärmann, Alexander Martin
A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation. Public Transp. 9(1-2): 95-113 (2017) - [j41]Andreas Bärmann, Alexander Martin
A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany. Transp. Sci. 51(4): 1102-1121 (2017) - 2016
- [j40]Andreas Bärmann, Andreas Heidt, Alexander Martin
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. Comput. Manag. Sci. 13(2): 151-193 (2016) - [j39]Frauke Liers
Binary Steiner trees: Structural results and an exact solution approach. Discret. Optim. 21: 85-117 (2016) - [j38]Veronika Grimm, Alexander Martin
Transmission and generation investment in electricity markets: The effects of market splitting and network fee regimes. Eur. J. Oper. Res. 254(2): 493-509 (2016) - 2015
- [j37]Andreas Bärmann, Frauke Liers
Solving network design problems via iterative aggregation. Math. Program. Comput. 7(2): 189-217 (2015) - [j36]Gerald Gamrath
Progress in presolving for mixed integer programming. Math. Program. Comput. 7(4): 367-398 (2015) - [j35]Marc E. Pfetsch
Validation of nominations in gas network optimization: models, methods, and solutions. Optim. Methods Softw. 30(1): 15-53 (2015) - [p2]Alexander Martin, Lars Schewe
Chapter 5: Mathematical optimization for evaluating gas network capacities. Evaluating Gas Network Capacities 2015: 87-102 - [p1]Björn Geißler, Alexander Martin, Antonio Morsi, Lars Schewe
Chapter 6: The MILP-relaxation approach. Evaluating Gas Network Capacities 2015: 103-122 - 2014
- [j34]Alexander Martin
Strict linear prices in non-convex European day-ahead electricity markets. Optim. Methods Softw. 29(1): 189-221 (2014) - 2013
- [c13]Katja Breitmoser, Björn Geißler, Alexander Martin:
Welfare Maximization of Autarkic Hybrid Energy Systems. OR 2013: 67-73 - 2012
- [j33]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4(3): 275-306 (2012) - [j32]Carlos Eduardo Ferreira
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design. SIAM J. Optim. 22(4): 1493-1517 (2012) - 2011
- [j31]Pia Domschke
Combination of Nonlinear and Linear Optimization of Transient Gas Networks. INFORMS J. Comput. 23(4): 605-617 (2011) - [j30]Björn Geißler, Oliver Kolb
Mixed integer linear models for the optimization of dynamical transport networks. Math. Methods Oper. Res. 73(3): 339-362 (2011) - [c12]Thorsten Ederer, Ulf Lorenz, Alexander Martin
Quantified Linear Programs: A Computational Study. ESA 2011: 203-214 - 2010
- [j29]Debora Mahlke, Alexander Martin
A mixed integer approach for time-dependent gas network optimization. Optim. Methods Softw. 25(4): 625-644 (2010) - [c11]Ulf Lorenz, Alexander Martin
Polyhedral and Algorithmic Properties of Quantified Linear Programs. ESA (1) 2010: 512-523
2000 – 2009
- 2009
- [j28]Armin Fügenschuh
Efficient reformulation and solution of a nonlinear PDE-controlled flow network model. Computing 85(3): 245-265 (2009) - [i1]Armin Fügenschuh, Björn Geißler, Alexander Martin, Antonio Morsi:
The Transport PDE and Mixed-Integer Linear Programming. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j27]Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin
On the Graph Bisection Cut Polytope. SIAM J. Discret. Math. 22(3): 1073-1098 (2008) - [j26]Armin Fügenschuh
A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations. SIAM J. Sci. Comput. 30(3): 1490-1507 (2008) - [j25]Armin Fügenschuh
Scheduling Locomotives and Car Transfers in Freight Transport. Transp. Sci. 42(4): 478-491 (2008) - [c10]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. IPCO 2008: 112-124 - 2007
- [j24]Debora Mahlke, Alexander Martin
A simulated annealing algorithm for transient optimization in gas networks. Math. Methods Oper. Res. 66(1): 99-115 (2007) - 2006
- [j23]Armin Fügenschuh
A multicriteria approach for optimizing bus schedules and school starting times. Ann. Oper. Res. 147(1): 199-216 (2006) - [j22]Andreas Eisenblätter, Hans-Florian Geerdes, Thorsten Koch
UMTS radio network evaluation and optimization beyond snapshots. Math. Methods Oper. Res. 63(1): 1-29 (2006) - [j21]Alexander Martin
Mixed Integer Models for the Stationary Case of Gas Network Optimization. Math. Program. 105(2-3): 563-582 (2006) - [j20]Tobias Achterberg, Thorsten Koch
MIPLIB 2003. Oper. Res. Lett. 34(4): 361-372 (2006) - [j19]Armin Fügenschuh
Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks. SIAM J. Optim. 16(4): 1155-1176 (2006) - [c9]Armin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin:
Locomotive and Wagon Scheduling in Freight Transport. ATMOS 2006 - [c8]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. EvoCOP 2006: 1-12 - 2005
- [j18]Tobias Achterberg, Thorsten Koch
Branching rules revisited. Oper. Res. Lett. 33(1): 42-54 (2005) - [c7]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin:
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. OR 2005: 315-320 - [c6]Herbert Birkhofer, Armin Fügenschuh, Ute Günther, Daniel Junglas, Alexander Martin, Thorsten Sauer, Stefan Ulbrich, Martin Wäldele, Stephan Walter:
Optimization of Sheet Metal Products. OR 2005: 327-336 - 2004
- [c5]Armin Fügenschuh, Alexander Martin, Peter Stöveken:
Integrated Optimization of School Starting Times and Public Bus Services. OR 2004: 150-157 - 2003
- [c4]Alexander Martin, Markus Möller:
Cutting Planes for the Optimisation of Gas Networks. HPSC 2003: 307-329 - 2002
- [j17]Hugues Marchand, Alexander Martin
Cutting planes in integer and mixed integer programming. Discret. Appl. Math. 123(1-3): 397-446 (2002) - 2001
- [c3]Alexander Martin
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. Computational Combinatorial Optimization 2001: 1-25 - 2000
- [j16]Robert E. Bixby, Alexander Martin
Parallelizing the Dual Simplex Method. INFORMS J. Comput. 12(1): 45-56 (2000)
1990 – 1999
- 1999
- [j15]Geir Dahl
Routing Through Virtual Paths in Layered Telecommunication Networks. Oper. Res. 47(5): 693-702 (1999) - 1998
- [j14]Ralf Borndörfer, Andreas Eisenblätter, Martin Grötschel, Alexander Martin:
Frequency assignment in cellular phone networks. Ann. Oper. Res. 76: 73-93 (1998) - [j13]Carlos Eduardo Ferreira, Alexander Martin
The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998) - [j12]Thorsten Koch
Solving Steiner tree problems in graphs to optimality. Networks 32(3): 207-232 (1998) - [j11]Ralf Borndörfer, Carlos E. Ferreira, Alexander Martin
Decomposing Matrices into Blocks. SIAM J. Optim. 9(1): 236-269 (1998) - [c2]Alexander Martin
The Intersection of Knapsack Polyhedra and Extensions. IPCO 1998: 243-256 - 1997
- [j10]Martin Grötschel, Alexander Martin
The Steiner tree packing problem in VLSI design. Math. Program. 77: 265-281 (1997) - 1996
- [j9]Martin Grötschel, Alexander Martin
Packing Steiner Trees: Further Facets. Eur. J. Comb. 17(1): 39-52 (1996) - [j8]Martin Grötschel, Alexander Martin
Packing Steiner trees: polyhedral investigations. Math. Program. 72: 101-123 (1996) - [j7]Martin Grötschel, Alexander Martin
Packing Steiner trees: a cutting plane algorithm and computational results. Math. Program. 72: 125-145 (1996) - [j6]Carlos Eduardo Ferreira, Alexander Martin
Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996) - [j5]Martin Grötschel, Alexander Martin
Packing Steiner Trees: Separation Algorithms. SIAM J. Discret. Math. 9(2): 233-257 (1996) - [j4]Carlos E. Ferreira, Alexander Martin
Solving Multiple Knapsack Problems by Cutting Planes. SIAM J. Optim. 6(3): 858-877 (1996) - 1995
- [j3]Martin Grötschel, Alexander Martin
Routing in grid graphs by cutting planes. Math. Methods Oper. Res. 41(3): 255-275 (1995) - 1994
- [j2]Michael Jünger, Alexander Martin
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. 63: 257-279 (1994) - 1993
- [j1]Carlos E. Ferreira, Martin Grötschel, Alexander Martin
Some integer programs arising in the design of main frame computers. ZOR Methods Model. Oper. Res. 38(1): 77-100 (1993) - [c1]Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. IPCO 1993: 447-461 - 1992
- [b1]Alexander Martin:
Packen von Steinerbäumen: polyedrische Studien und Anwendung. University of Augsburg, Germany, 1992, pp. 1-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 20:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: