Economics - Discrete Optimization - Mathematics (EDOM)

Address:
Cauerstraße 11
91058 Erlangen



Subordinate Organisational Units

Juniorprofessur für Algorithmische Diskrete Mathematik
Juniorprofessur für Optimierung von Energiesystemen


Research Fields

Analytics
Energy
Engineering and Physics
Logistics and Production
Mixed Integer Programming


Related Project(s)

Go to first page Go to previous page 2 of 2 Go to next page Go to last page

(SFB TRR 154 “Mathematische Modellierung, Simulation und Optimierung am Beispiel von Gasnetzen”):
Welfare optimal nominations in gas networks and associated equilibria
Prof. Dr. Veronika Grimm; PD Dr. Lars Schewe; Prof. Dr. Martin Schmidt; Prof. Dr. Gregor Zöttl
(01/10/2016 - 30/06/2018)


(TRR 154: Mathematical Modelling, Simulation and Optimisation Using the Example of Gas Networks):
Adaptive MIP-Relaxations for MINLPs (B07) (2014 - 2018)
Prof. Dr. Alexander Martin; PD Dr. Lars Schewe
(01/10/2014)


TRR 154: TRR 154: Mathematical Modelling, Simulation and Optimisation Using the Example of Gas Networks
Prof. Dr. Alexander Martin
(01/07/2014)


(TRR 154: Mathematical Modelling, Simulation and Optimisation Using the Example of Gas Networks):
Decomposition methods for mixed-integer optimal control (A05) (2014 - 2018)
Prof. Dr. Günter Leugering; Prof. Dr. Alexander Martin
(01/07/2014)


(TRR 154: Mathematical Modelling, Simulation and Optimisation Using the Example of Gas Networks):
Central Tasks (Z03) (2014 - 2022)
Prof. Dr. Alexander Martin
(01/07/2014)



Publications (Download BibTeX)

Go to first page Go to previous page 8 of 8 Go to next page Go to last page

Martin, A. (2002). Cutting Planes in Integer and Mixed Integer Programming. Discrete Applied Mathematics, 123/124, 391 -- 440. https://dx.doi.org/10.1016/S0166-218X(01)00348-1
Martin, A. (2002). Large Scale Optimization. In Encyclopedia of Life Support Systems (EOLSS) (pp. 411 -- 428). UNESCO.
Martin, A. (2001). General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In D. Naddef, M. Jünger (Eds.), Computational Combinatorial Optimization Springer, Berlin.
Bixby, R.E., & Martin, A. (2000). Parallelizing the Dual Simplex Method. Informs Journal on Computing, 12, 45 -- 56.
Martin, A. (1999). Integer programs with block structure (Habilitation).
Martin, A., & Weismantel, R. (1998). The Intersection of Knapsack Polyhedra and Extensions. In R.E. Bixby, E.A. Boyd, R.Z. Ríos-Mercado (Eds.), Integer Programming and Combinatorial Optimization (pp. 243 - 256).
Koch, T., & Martin, A. (1998). Solving Steiner Tree Problems in Graphs to Optimality. Networks, 32, 207 -- 232.
Borndörfer, R., E. Ferreira, C., & Martin, A. (1998). Decomposing Matrices into Blocks. SIAM Journal on Optimization, 9, 236 -- 269.
Grötschel, M., Martin, A., & Weismantel, R. (1997). The Steiner Tree Packing Problem in VLSI-Design. Mathematical Programming, 78, 265 - 281.
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner Trees: A Cutting Plane Algorithm and Computational Results. Mathematical Programming, 72, 125 - 145.
Grötschel, M., Martin, A., & Weismantel, R. (1996). Optimum path packing on wheels: The consecutive case. Computers & Mathematics With Applications, 31, 23 - 35.
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner trees: Further facets. European Journal of Combinatorics, 17, 39 - 52.
E. Ferreira, C., Martin, A., de Souza, C.C., Weismantel, R., & Wolsey, L. (1996). Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, 74, 247 - 266.
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner Trees: Polyhedral Investigations. Mathematical Programming, 72, 101 - 123.
E. Ferreira, C., Martin, A., & Weismantel, R. (1996). Solving Multiple Knapsack Problems by Cutting Planes. SIAM Journal on Optimization, 6, 858 - 877.
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner trees: Separation algorithms. SIAM Journal on Discrete Mathematics, 9, 233 - 257.
Jünger, M., Martin, A., Reinelt, G., & Weismantel, R. (1994). Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Mathematical Programming, 63, 257 - 279.
Grötschel, M., Martin, A., & Weismantel, R. (1993). Routing in Grid Graphs by Cutting Planes. In G. Rinaldi, L.A. Wolsey (Eds.), Integer Programming and Combinatorial Optimization (pp. 447 - 463).
Martin, A. (1993). Packing Paths and Steiner Trees: Routing of Electronic Circuits. , 6, 185 -- 204.
Martin, A. (1990). A polynomially solvable case of the separation problem for the Steiner partition inequalities. Mathematical Methods of Operations Research, 62, 277 -- 284.


Publications in addition (Download BibTeX)


Grimm, V., Kleinert, T., Liers, F., Schmidt, M., & Zöttl, G. (2019). Optimal price zones in electricity markets: a mixed-integer multilevel model and global solution approaches. Optimization Methods & Software, 34(2), 406-436. https://dx.doi.org/10.1080/10556788.2017.1401069
Gottschalk, C., Koster, A., Liers, F., Peis, B., Schmand, D., & Wierz, A. (2017). Robust flows over time: models and complexity results. Mathematical Programming. https://dx.doi.org/10.1007/s10107-017-1170-3
Liers, F., & Merkert, M. (2016). Structural Investigation of Piecewise Linearized Network Flow Problems. SIAM Journal on Optimization, 26(4), 2863-2886. https://dx.doi.org/10.1137/15M1006751
Heidt, A., Helmke, H., Kapolke, M., Liers, F., & Martin, A. (2016). Robust runway scheduling under uncertain conditions. Journal of Air Transport Management, 56(Part A), 28-37. https://dx.doi.org/10.1016/j.jairtraman.2016.02.009
Liers, F., Martin, A., & Pape, S. (2016). Binary Steiner Trees: Structural Results and an Exact Solution Approach. Discrete Optimization, 21, 85-117. https://dx.doi.org/10.1016/j.disopt.2016.05.006
Kapolke, M., Fürstenau, N., Heidt, A., Liers, F., Mittendorf, M., & Weiß, C. (2016). Pre-tactical optimization of runway utilization under uncertainty. Journal of Air Transport Management. https://dx.doi.org/10.1016/j.jairtraman.2016.02.004
Bärmann, A., Liers, F., Martin, A., Merkert, M., Thurner, C., & Weninger, D. (2015). Solving Network Design Problems via Iterative Aggregation. Mathematical Programming Computation, 7(2), 189-217. https://dx.doi.org/10.1007/s12532-015-0079-1
Fürstenau, N., Heidt, A., Kapolke, M., Liers, F., Mittendorf, M., & Weiß, C. (2015). Pre-Tactical Planning of Runway Utilization Under Uncertainty: Optimization and Validation. In Dirk Schäfer (Eds.), Proceedings of the SESAR Innovations Days 2015 Eurocontrol.
Heidt, A., Kapolke, M., Liers, F., Fürstenau, N., & Helmke, H. (2014). Pre-tactical Time Window assignment: Runway Utilization and the Impact of Uncertainties. In Dirk Schaefer, Javier Saez (Eds.), Proceedings of the SESAR Innovation Days 2014.
Heidt, A., Helmke, H., Liers, F., & Martin, A. (2014). Robust Runway Scheduling using a time-indexed model. In D.~Schäfer (Eds.), Proceedings of the SESAR Innovation Days 2014.

Last updated on 2019-11-07 at 23:51