default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Fischer 0002
Person information
- affiliation: University of Mainz, Institute of Computer Science, Germany
- affiliation (former): University of Kassel, Institute for Mathematics, Germany
Other persons with the same name
- Frank Fischer — disambiguation page
- Frank Fischer 0001
![[0000-0003-0253-659X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-0253-659X")
— LMU Munich, Germany - Frank Fischer 0003 — Humboldt University of Berlin, Germany
- Frank Fischer 0004 — University of Erlangen-Nuremberg, Germany
- Frank Fischer 0005 — Freie Universität Berlin, Germany (and 2 more)
- Frank Fischer 0006 — University of Tübingen, Germany
- Frank Fischer 0007 — Beiersdorf AG, Hamburg, Germany
- Frank Fischer 0008 — University of Freiburg, Freiburg im Breisgau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier:
Exact approaches for the combined cell layout problem. Eur. J. Oper. Res. 305(2): 530-546 (2023)- 2022
- [j11]Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimization problems with monotone monomials in the objective. Discret. Appl. Math. 308: 20-35 (2022) - 2020
- [j10]Mirko Dahlbeck, Anja Fischer, Frank Fischer:
Decorous combinatorial lower bounds for row layout problems. Eur. J. Oper. Res. 286(3): 929-944 (2020) - [c8]Markus Blumenstock, Frank Fischer:
A Constructive Arboricity Approximation Scheme. SOFSEM 2020: 51-63
2010 – 2019
- 2019
- [j9]Anja Fischer, Frank Fischer:
Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof. J. Graph Theory 92(3): 230-236 (2019) - [j8]Anja Fischer, Frank Fischer, Philipp Hungerländer:
New exact approaches to row layout problems. Math. Program. Comput. 11(4): 703-754 (2019) - [c7]Andreas Bley, Angela Pape, Frank Fischer:
A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems. OR 2019: 249-255 - 2018
- [j7]Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimisation problems with nested non-linear monomials in the objective function. Math. Program. 169(2): 417-446 (2018) - 2017
- [c6]Frank Fischer, Thomas Schlechte:
Strong Relaxations for the Train Timetabling Problem Using Connected Configurations. ATMOS 2017: 11:1-11:16 - 2016
- [c5]Frank Fischer, Boris Grimm, Torsten Klug, Thomas Schlechte:
A Re-optimization Approach for Train Dispatching. OR 2016: 645-651 - 2015
- [j6]Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Comput. 3(2): 285-298 (2015) - [j5]Anja Fischer, Frank Fischer:
An extended approach for lifting clique tree inequalities. J. Comb. Optim. 30(3): 489-519 (2015) - [c4]Frank Fischer:
Ordering Constraints in Time Expanded Networks for Train Timetabling Problems. ATMOS 2015: 97-110 - [c3]Anja Fischer, Frank Fischer, Philipp Hungerländer:
A New Exact Approach to the Space-Free Double Row Layout Problem. OR 2015: 125-130 - 2014
- [j4]Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discret. Appl. Math. 166: 97-114 (2014) - [j3]Frank Fischer, Christoph Helmberg:
Dynamic graph generation for the shortest path problem in time expanded networks. Math. Program. 143(1-2): 257-297 (2014) - [j2]Frank Fischer, Christoph Helmberg:
A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions. SIAM J. Optim. 24(2): 795-822 (2014) - 2013
- [j1]Anja Fischer, Frank Fischer:
Complete description for the spanning tree problem with one linearised quadratic term. Oper. Res. Lett. 41(6): 701-705 (2013) - 2010
- [c2]Frank Fischer, Christoph Helmberg:
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. ATMOS 2010: 45-60
2000 – 2009
- 2008
- [c1]Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz:
Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. ATMOS 2008
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-10 21:43 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:
