2006 |
13 | EE | Torsten Fahle,
Karsten Tiemann:
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.
ACM Journal of Experimental Algorithmics 11: (2006) |
12 | EE | Stefan Bertels,
Torsten Fahle:
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem.
Computers & OR 33(10): 2866-2890 (2006) |
2005 |
11 | EE | Torsten Fahle,
Karsten Tiemann:
An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
WEA 2005: 89-100 |
2003 |
10 | EE | Torsten Fahle,
Rainer Feldmann,
Silvia Götz,
Sven Grothklags,
Burkhard Monien:
The Aircraft Sequencing Problem.
Computer Science in Perspective 2003: 152-166 |
9 | EE | Meinolf Sellmann,
Torsten Fahle:
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem.
Annals OR 118(1-4): 17-33 (2003) |
2002 |
8 | EE | Torsten Fahle:
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique.
ESA 2002: 485-498 |
7 | EE | Torsten Fahle,
Ulrich Junker,
Stefan E. Karisch:
Preface.
Annals OR 115(1-4): 13-14 (2002) |
6 | EE | Meinolf Sellmann,
Kyriakos Zervoudakis,
Panagiotis Stamatopoulos,
Torsten Fahle:
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search.
Annals OR 115(1-4): 207-225 (2002) |
5 | EE | Torsten Fahle,
Meinolf Sellmann:
Cost Based Filtering for the Constrained Knapsack Problem.
Annals OR 115(1-4): 73-93 (2002) |
4 | | Torsten Fahle,
Ulrich Junker,
Stefan E. Karisch,
Niklas Kohl,
Meinolf Sellmann,
Bo Vaaben:
Constraint Programming Based Column Generation for Crew Assignment.
J. Heuristics 8(1): 59-81 (2002) |
2001 |
3 | EE | Torsten Fahle,
Stefan Schamberger,
Meinolf Sellmann:
Symmetry Breaking.
CP 2001: 93-107 |
2 | EE | Meinolf Sellmann,
Torsten Fahle:
Coupling Variable Fixing Algorithms for the Automatic Recording Problem.
ESA 2001: 134-145 |
1999 |
1 | | Ulrich Junker,
Stefan E. Karisch,
Niklas Kohl,
Bo Vaaben,
Torsten Fahle,
Meinolf Sellmann:
A Framework for Constraint Programming Based Column Generation.
CP 1999: 261-274 |