Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts Erlendur S. ThorsteinssonGreger Ottosson OriginalPaper Pages: 15 - 29
Improved Local Search for CP Toolkits Paul ShawBruno De BackerVincent Furnon OriginalPaper Pages: 31 - 50
Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search Steven Prestwich OriginalPaper Pages: 51 - 72
Cost Based Filtering for the Constrained Knapsack Problem Torsten FahleMeinolf Sellmann OriginalPaper Pages: 73 - 93
Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach Hak-Jin KimJohn N. Hooker OriginalPaper Pages: 95 - 124
Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem Ulrich DorndorfErwin PeschToàn Phan-Huy OriginalPaper Pages: 125 - 145
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment Peter BruckerSigrid Knust OriginalPaper Pages: 147 - 172
An Improved Hybrid Model for the Generic Hoist Scheduling Problem Daniel RieraNeil Yorke-Smith OriginalPaper Pages: 173 - 191
A General Approach to the Physician Rostering Problem Louis-Martin RousseauGilles PesantMichel Gendreau OriginalPaper Pages: 193 - 205
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search Meinolf SellmannKyriakos ZervoudakisTorsten Fahle OriginalPaper Pages: 207 - 225
BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management C.D. TarantilisC.T. Kiranoudis OriginalPaper Pages: 227 - 241