Frank Fischer

According to our database, Frank Fischer authored at least 20 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Exact approaches for the combined cell layout problem.

Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier

Eur. J. Oper. Res., 2023

2022

Matroid optimization problems with monotone monomials in the objective.

Anja Fischer, Frank Fischer, S. Thomas McCormick

Discret. Appl. Math., 2022

2020

Decorous combinatorial lower bounds for row layout problems.

Mirko Dahlbeck, Anja Fischer, Frank Fischer

Eur. J. Oper. Res., 2020

A Constructive Arboricity Approximation Scheme.

Markus Blumenstock, Frank Fischer

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

New exact approaches to row layout problems.

Anja Fischer, Frank Fischer, Philipp Hungerländer

Math. Program. Comput., 2019

Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof.

Anja Fischer, Frank Fischer

J. Graph Theory, 2019

A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems.

Andreas Bley, Angela Pape, Frank Fischer

Proceedings of the Operations Research Proceedings 2019, 2019

2018

Matroid optimisation problems with nested non-linear monomials in the objective function.

Anja Fischer, Frank Fischer, S. Thomas McCormick

Math. Program., 2018

2017

Strong Relaxations for the Train Timetabling Problem Using Connected Configurations.

Frank Fischer, Thomas Schlechte

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

A Re-optimization Approach for Train Dispatching.

Frank Fischer, Boris Grimm, Torsten Klug, Thomas Schlechte

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015

An extended approach for lifting clique tree inequalities.

Anja Fischer, Frank Fischer

J. Comb. Optim., 2015

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.

Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse

Comput., 2015

A New Exact Approach to the Space-Free Double Row Layout Problem.

Anja Fischer, Frank Fischer, Philipp Hungerländer

Proceedings of the Operations Research Proceedings 2015, 2015

Ordering Constraints in Time Expanded Networks for Train Timetabling Problems.

Frank Fischer

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions.

Frank Fischer, Christoph Helmberg

SIAM J. Optim., 2014

Dynamic graph generation for the shortest path problem in time expanded networks.

Frank Fischer, Christoph Helmberg

Math. Program., 2014

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.

Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse

Discret. Appl. Math., 2014

2013

Complete description for the spanning tree problem with one linearised quadratic term.

Anja Fischer, Frank Fischer

Oper. Res. Lett., 2013

2010

Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling.

Frank Fischer, Christoph Helmberg

Proceedings of the ATMOS 2010, 2010

2008

Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation.

Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz

Proceedings of the ATMOS 2008, 2008