Alexander Martin

Martin Schmidt

Benjamin Seith

Nikolai Vogl

Eur. J. Oper. Res., 2021

2020

Two-row and two-column mixed-integer presolve using hashing-based pairing methods.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2020

AutoIoT: a framework based on user-driven MDE for generating IoT applications.

[BibT_eX]

[DOI]

Thiago Nepomuceno

Tiago Carneiro

Paulo Henrique M. Maia

Muhammad Adnan

Thalyson Nepomuceno

Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

2019

Vorhersage von Ersatzteilbedarfen mit Hilfe von Clusteringverfahren.

[BibT_eX]

[DOI]

HMD Prax. Wirtsch., 2019

2018

Towards simulation based mixed-integer optimization with differential equations.

[BibT_eX]

[DOI]

Networks, 2018

An Online-Learning Approach to Inverse Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany.

[BibT_eX]

[DOI]

Andreas Bärmann

Hanno Schülldorf

Transp. Sci., 2017

A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation.

[BibT_eX]

[DOI]

Andreas Bärmann

Oskar Schneider

Public Transp., 2017

Pricing and clearing combinatorial markets with singleton and swap orders.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2017

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2017

2016

Transmission and generation investment in electricity markets: The effects of market splitting and network fee regimes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Binary Steiner trees: Structural results and an exact solution approach.

[BibT_eX]

[DOI]

Frauke Liers

Susanne Pape

Discret. Optim., 2016

Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2016

2015

Validation of nominations in gas network optimization: models, methods, and solutions.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2015

Progress in presolving for mixed integer programming.

[BibT_eX]

[DOI]

Gerald Gamrath

Matthias Miltenberger

Dieter Weninger

Math. Program. Comput., 2015

Solving network design problems via iterative aggregation.

[BibT_eX]

[DOI]

Math. Program. Comput., 2015

Chapter 6: The MILP-relaxation approach.

[BibT_eX]

[DOI]

Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 5: Mathematical optimization for evaluating gas network capacities.

[BibT_eX]

[DOI]

Proceedings of the Evaluating Gas Network Capacities, 2015

2014

Strict linear prices in non-convex European day-ahead electricity markets.

[BibT_eX]

[DOI]

Johannes C. Müller

Sebastian Pokutta

Optim. Methods Softw., 2014

2013

Welfare Maximization of Autarkic Hybrid Energy Systems.

[BibT_eX]

[DOI]

Katja Breitmoser

Björn Geißler

Proceedings of the Operations Research Proceedings 2013, 2013

2012

Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Ute Günther

SIAM J. Optim., 2012

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.

[BibT_eX]

[DOI]

Math. Program. Comput., 2012

2011

Mixed integer linear models for the optimization of dynamical transport networks.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2011

Combination of Nonlinear and Linear Optimization of Transient Gas Networks.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

Quantified Linear Programs: A Computational Study.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

A mixed integer approach for time-dependent gas network optimization.

[BibT_eX]

[DOI]

Debora Mahlke

Susanne Moritz

Optim. Methods Softw., 2010

Polyhedral and Algorithmic Properties of Quantified Linear Programs.

[BibT_eX]

[DOI]

Ulf Lorenz

Jan Wolf

Proceedings of the Algorithms, 2010

2009

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

[BibT_eX]

[DOI]

Computing, 2009

The Transport PDE and Mixed-Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Scheduling Locomotives and Car Transfers in Freight Transport.

[BibT_eX]

[DOI]

Transp. Sci., 2008

A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2008

On the Graph Bisection Cut Polytope.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

A simulated annealing algorithm for transient optimization in gas networks.

[BibT_eX]

[DOI]

Debora Mahlke

Susanne Moritz

Math. Methods Oper. Res., 2007

2006

Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

MIPLIB 2003.

[BibT_eX]

[DOI]

Tobias Achterberg

Oper. Res. Lett., 2006

Mixed Integer Models for the Stationary Case of Gas Network Optimization.

[BibT_eX]

[DOI]

Markus Möller

Susanne Moritz

Math. Program., 2006

UMTS radio network evaluation and optimization beyond snapshots.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2006

A multicriteria approach for optimizing bus schedules and school starting times.

[BibT_eX]

[DOI]

Armin Fügenschuh

Ann. Oper. Res., 2006

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

Locomotive and Wagon Scheduling in Freight Transport.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2006, 2006

2005

Branching rules revisited.

[BibT_eX]

[DOI]

Tobias Achterberg

Oper. Res. Lett., 2005

Optimization of Sheet Metal Products.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2005, 2005

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2005, 2005

2004

Integrated Optimization of School Starting Times and Public Bus Services.

[BibT_eX]

[DOI]

Armin Fügenschuh

Peter Stöveken

Proceedings of the Operations Research, 2004

2003

Cutting Planes for the Optimisation of Gas Networks.

[BibT_eX]

[DOI]

Markus Möller

Proceedings of the Modeling, 2003

2002

Cutting planes in integer and mixed integer programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computational Combinatorial Optimization, 2001

2000

Parallelizing the Dual Simplex Method.

[BibT_eX]

[DOI]

Robert E. Bixby

INFORMS J. Comput., 2000

1999

Routing Through Virtual Paths in Layered Telecommunication Networks.

[BibT_eX]

[DOI]

Geir Dahl

Mechthild Stoer

Oper. Res., 1999

1998

Decomposing Matrices into Blocks.

[BibT_eX]

[DOI]

Ralf Borndörfer

Carlos E. Ferreira

SIAM J. Optim., 1998

Solving Steiner tree problems in graphs to optimality.

[BibT_eX]

[DOI]

Networks, 1998

The node capacitated graph partitioning problem: A computational study.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1998

Frequency assignment in cellular phone networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1998

The Intersection of Knapsack Polyhedra and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

The Steiner tree packing problem in VLSI design.

[BibT_eX]

[DOI]

Math. Program., 1997

1996

Solving Multiple Knapsack Problems by Cutting Planes.

[BibT_eX]

[DOI]

Carlos E. Ferreira

SIAM J. Optim., 1996

Packing Steiner Trees: Separation Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.

[BibT_eX]

[DOI]

Math. Program., 1996

Packing Steiner trees: polyhedral investigations.

[BibT_eX]

[DOI]

Math. Program., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1996

Packing Steiner Trees: Further Facets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

1995

Routing in grid graphs by cutting planes.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

1994

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

[BibT_eX]

[DOI]

Math. Program., 1994

1993

Some integer programs arising in the design of main frame computers.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

1992

Packen von Steinerbäumen: polyedrische Studien und Anwendung.

[BibT_eX]

[DOI]