Torsten Fahle

1.1k total citations
9 papers, 473 citations indexed

About

Torsten Fahle is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Torsten Fahle has authored 9 papers receiving a total of 473 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Industrial and Manufacturing Engineering, 4 papers in Computer Networks and Communications and 3 papers in Computational Theory and Mathematics. Recurrent topics in Torsten Fahle's work include Vehicle Routing Optimization Methods (5 papers), Constraint Satisfaction and Optimization (4 papers) and Scheduling and Timetabling Solutions (3 papers). Torsten Fahle is often cited by papers focused on Vehicle Routing Optimization Methods (5 papers), Constraint Satisfaction and Optimization (4 papers) and Scheduling and Timetabling Solutions (3 papers). Torsten Fahle collaborates with scholars based in Germany, Greece and Canada. Torsten Fahle's co-authors include Meinolf Sellmann, Stefan Schamberger, Stefan E. Karisch, Ulrich Junker, Bo Vaaben, Niklas Kohl and Panagiotis Stamatopoulos and has published in prestigious journals such as Computers & Operations Research, Annals of Operations Research and Journal of Heuristics.

In The Last Decade

Torsten Fahle

9 papers receiving 425 citations

Peers

Torsten Fahle

IME

MSOR

CNC

AE

AI

Esteban Feuerstein Argentina

Kerem Bülbül Türkiye

Larry W. Jacobs United States

Gaia Nicosia Italy

Thiago F. Noronha Brazil

Sylvain Boussier France

Daniel Karapetyan United Kingdom

L. G. Proll United Kingdom

Nysret Musliu Austria

Esteban Feuerstein Argentina

Torsten Fahle

113 ×0.3

IME

65 ×0.3

MSOR

174 ×1.3

CNC

67 ×0.6

AE

29 ×0.6

AI

Citations per year, relative to Torsten Fahle Torsten Fahle (= 1×) peers Esteban Feuerstein

Countries citing papers authored by Torsten Fahle

Since Specialization

Citations

This map shows the geographic impact of Torsten Fahle's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Torsten Fahle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Torsten Fahle more than expected).

Fields of papers citing papers by Torsten Fahle

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Torsten Fahle. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Torsten Fahle. The network helps show where Torsten Fahle may publish in the future.

Co-authorship network of co-authors of Torsten Fahle

This figure shows the co-authorship network connecting the top 25 collaborators of Torsten Fahle. A scholar is included among the top collaborators of Torsten Fahle based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Torsten Fahle. Torsten Fahle is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

9 of 9 papers shown

1.

Fahle, Torsten, et al.. (2007). A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ACM Journal of Experimental Algorithmics. 11. 1 indexed citations

2.

Fahle, Torsten, et al.. (2005). A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers & Operations Research. 33(10). 2866–2890. 228 indexed citations

3.

Sellmann, Meinolf & Torsten Fahle. (2003). Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research. 118(1-4). 17–33. 12 indexed citations

4.

Fahle, Torsten. (2002). Simple and Fast: Improving a Branch-and-Bound Algorithm for Maximum Clique. 4 indexed citations

5.

Fahle, Torsten, Ulrich Junker, Stefan E. Karisch, et al.. (2002). Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics. 8(1). 59–81. 59 indexed citations

6.

Fahle, Torsten & Meinolf Sellmann. (2002). Cost Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research. 115(1-4). 73–93. 17 indexed citations

7.

Sellmann, Meinolf, et al.. (2002). Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Annals of Operations Research. 115(1-4). 207–225. 21 indexed citations

8.

Fahle, Torsten, Stefan Schamberger, & Meinolf Sellmann. (2001). Symmetry Breaking. 93–107. 68 indexed citations

9.

Fahle, Torsten, et al.. (1999). A parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research. 86(0). 585–607. 63 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact