default search action
Torsten Fahle
Person information
- affiliation (former): University of Paderborn
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c8]Torsten Fahle, Wolfgang Vermöhlen:
Fair Cyclic Roster Planning - A Case Study for a Large European Airport. OR 2014: 129-135 - 2011
- [c7]Torsten Fahle:
Check-In Counter Planning via a Network Flow Approach. OR 2011: 395-400
2000 – 2009
- 2006
- [j8]Stefan Bertels, Torsten Fahle:
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33(10): 2866-2890 (2006) - [j7]Torsten Fahle, Karsten Tiemann:
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ACM J. Exp. Algorithmics 11 (2006) - 2005
- [c6]Torsten Fahle, Karsten Tiemann:
An Improved Branch-and-Bound Algorithm for the Test Cover Problem. WEA 2005: 89-100 - 2003
- [j6]Meinolf Sellmann, Torsten Fahle:
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Ann. Oper. Res. 118(1-4): 17-33 (2003) - [c5]Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien:
The Aircraft Sequencing Problem. Computer Science in Perspective 2003: 152-166 - 2002
- [b1]Torsten Fahle:
Integrating concepts from constraint programming and operations research algorithms. University of Paderborn, Germany, 2002, pp. 1-252 - [j5]Torsten Fahle, Ulrich Junker
, Stefan E. Karisch:
Preface. Ann. Oper. Res. 115(1-4): 13-14 (2002) - [j4]Torsten Fahle, Meinolf Sellmann:
Cost Based Filtering for the Constrained Knapsack Problem. Ann. Oper. Res. 115(1-4): 73-93 (2002) - [j3]Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis Stamatopoulos
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Ann. Oper. Res. 115(1-4): 207-225 (2002) - [j2]Torsten Fahle, Ulrich Junker
Constraint Programming Based Column Generation for Crew Assignment. J. Heuristics 8(1): 59-81 (2002) - [c4]Torsten Fahle:
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. ESA 2002: 485-498 - 2001
- [c3]Torsten Fahle, Stefan Schamberger, Meinolf Sellmann:
Symmetry Breaking. CP 2001: 93-107 - [c2]Meinolf Sellmann, Torsten Fahle:
Coupling Variable Fixing Algorithms for the Automatic Recording Problem. ESA 2001: 134-145
1990 – 1999
- 1999
- [j1]Jürgen Schulze, Torsten Fahle:
A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86: 585-607 (1999) - [c1]Ulrich Junker
A Framework for Constraint Programming Based Column Generation. CP 1999: 261-274
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-04-25 05:50 CEST 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: