Torsten Fahle

发表

Constraint Programming Based Column Generation with Knapsack Subproblems

Meinolf Sellmann, Torsten Fahle, 1999 .

A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem

Torsten Fahle, Stefan Bertels, Torsten Fahle, 2006, Comput. Oper. Res..

Cp-based lagrangian relaxation for a multimedia application

Meinolf Sellmann, Torsten Fahle, 2001 .

Check-In Counter Planning via a Network Flow Approach

Torsten Fahle, Torsten Fahle, 2011, OR.

Stefan E. Karisch, Ulrich Junker, Torsten Fahle, 1989, Ann. Oper. Res..

Coupling Variable Fixing Algorithms for the Automatic Recording Problem

Meinolf Sellmann, Torsten Fahle, 2001, ESA.

Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

Torsten Fahle, Torsten Fahle, 2002, ESA.

Cost Based Filtering for the Constrained Knapsack Problem

Meinolf Sellmann, Torsten Fahle, 2002, Ann. Oper. Res..

A parallel algorithm for the vehicle routing problem with time window constraints

Jürgen Schulze, Torsten Fahle, Jürgen Schulze, 1999, Ann. Oper. Res..

Constraint Programming Based Column Generation for Crew Assignment

Stefan E. Karisch, Meinolf Sellmann, Niklas Kohl, 2002, J. Heuristics.

Fair Cyclic Roster Planning - A Case Study for a Large European Airport

Torsten Fahle, Wolfgang Vermöhlen, 2014, OR.

A Framework for Constraint Programming Based Column Generation

Stefan E. Karisch, Meinolf Sellmann, Niklas Kohl, 1999, CP.

Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search

Panagiotis Stamatopoulos, Meinolf Sellmann, Torsten Fahle, 2002, Ann. Oper. Res..

Integrating Direct CP Search and CP-based Column Generation for the Airline Crew Assignment Problem

Panagiotis Stamatopoulos, Meinolf Sellmann, Torsten Fahle, 2000 .

Partizipative Personaleinsatzplanung für den ambulanten Pflegedienst. Abschlussbericht des BMBF-Forschungsprojektes PARPAP

M. Rott, Peter Knauth, Torsten Fahle, 2003 .

Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem

Meinolf Sellmann, Torsten Fahle, 2003, Ann. Oper. Res..

A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques

Torsten Fahle, Karsten Tiemann, Torsten Fahle, 2007, ACM J. Exp. Algorithmics.

An Improved Branch-and-Bound Algorithm for the Test Cover Problem

Torsten Fahle, Karsten Tiemann, 2005, WEA.

Integrating concepts from constraint programming and operations research algorithms

Torsten Fahle, 2002 .

The Aircraft Sequencing Problem

Burkhard Monien, Rainer Feldmann, Torsten Fahle, 2003, Computer Science in Perspective.

Symmetry Breaking

Meinolf Sellmann, Stefan Schamberger, Torsten Fahle, 2001, CP.

Cost Based Filtering vs. Upper Bounds for Maximum Clique

Torsten Fahle, 2002 .