Frank Fischer

21 papers B 1C 4Journal 13Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
An asynchronous proximal bundle method.
Math. Program.
Frank Fischer
2023 J jnl
Exact approaches for the combined cell layout problem.
Eur. J. Oper. Res.
Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier
2022 J jnl
Matroid optimization problems with monotone monomials in the objective.
Discret. Appl. Math.
Anja Fischer, Frank Fischer, S. Thomas McCormick
2020 B conf
A Constructive Arboricity Approximation Scheme.
SOFSEM
Markus Blumenstock, Frank Fischer
2020 J jnl
Decorous combinatorial lower bounds for row layout problems.
Eur. J. Oper. Res.
Mirko Dahlbeck, Anja Fischer, Frank Fischer
2019 — conf
A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems.
OR
Andreas Bley, Angela Pape, Frank Fischer
2019 J jnl
Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof.
J. Graph Theory
Anja Fischer, Frank Fischer
2019 J jnl
New exact approaches to row layout problems.
Math. Program. Comput.
Anja Fischer, Frank Fischer, Philipp Hungerländer
2018 J jnl
Matroid optimisation problems with nested non-linear monomials in the objective function.
Math. Program.
Anja Fischer, Frank Fischer, S. Thomas McCormick
2017 C conf
Strong Relaxations for the Train Timetabling Problem Using Connected Configurations.
ATMOS
Frank Fischer, Thomas Schlechte
2016 — conf
A Re-optimization Approach for Train Dispatching.
OR
Frank Fischer, Boris Grimm, Torsten Klug, Thomas Schlechte
2015 — conf
A New Exact Approach to the Space-Free Double Row Layout Problem.
OR
Anja Fischer, Frank Fischer, Philipp Hungerländer
2015 J jnl
An extended approach for lifting clique tree inequalities.
J. Comb. Optim.
Anja Fischer, Frank Fischer
2015 J jnl
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.
Comput.
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
2015 C conf
Ordering Constraints in Time Expanded Networks for Train Timetabling Problems.
ATMOS
Frank Fischer
2014 J jnl
A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions.
SIAM J. Optim.
Frank Fischer, Christoph Helmberg
2014 J jnl
Dynamic graph generation for the shortest path problem in time expanded networks.
Math. Program.
Frank Fischer, Christoph Helmberg
2014 J jnl
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.
Discret. Appl. Math.
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
2013 J jnl
Complete description for the spanning tree problem with one linearised quadratic term.
Oper. Res. Lett.
Anja Fischer, Frank Fischer
2010 C conf
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling.
ATMOS
Frank Fischer, Christoph Helmberg
2008 C conf
Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation.
ATMOS
Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz