|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Thursday 30 January:
Thursday 11:15-12:30 TA-1: COMEX - Optimization 1 Room Vesale 023 - Chair: M. Schyns
Thursday 11:15-12:30 TA-2: Software and Implementation Room Vesale 020 - Chair: M. Mezmaz
Thursday 11:15-12:30 TA-3: COMEX - Smart mobility Room Vesale 025 - Chair: A. Caris
Thursday 11:15-12:30 TA-4: Systems Room Pentagone 0A11 - Chair: P. Kunsch
Thursday 14:00-15:40 TB-1: Data Analysis 1 Room Vesale 023 - Chair: X.Siebert
Thursday 14:00-15:40 TB-2: Multiple Objectives Room Vesale 020 - Chair: Y. de Smet
Thursday 14:00-15:40 TB-3: Logistics Room Vesale 025 - Chair: D. De Wolf
Thursday 14:00-15:40 TB-4: COMEX - Applications to Economy Room Pentagone 0A11 - Chair: W. Brauers
Thursday 14:00-15:40 TB-5: Networks Room Pentagone 0A07 - Chair: B. Fortz
Thursday 16:10-17:25 TC-1: Mixed-integer nonlinear programming Room Vesale 023 - Chair: Y. Crama
Thursday 16:10-17:25 TC-2: Decision Analysis 1 Room Vesale 020 - Chair: S. Eppe
Thursday 16:10-17:25 TC-3: Routing Room Vesale 025 - Chair: K. Sörensen
Thursday 16:10-17:25 TC-4: Graphs Room Pentagone 0A11 - Chair: H. Mélot
Thursday 16:10-17:25 TC-5: Scheduling Room Pentagone 0A07 - Chair: S. Hanafi
Friday 9:00-10:15 FA-1: Queuing Room Vesale 023 - Chair: S. Wittevrongel
Friday 9:00-10:15 FA-2: Decision Analysis 2 Room Vesale 020 - Chair: R. Bisdorff
Friday 9:00-10:15 FA-3: COMEX - Optimization 2 Room Vesale 025 - Chair: M. Labbé
Friday 9:00-10:15 FA-4: Production Room Pentagone 0A11 - Chair: D. Tuyttens
Friday 14:00-15:40 FB-1: Data Analysis 2 Room Vesale 023 - Chair: P. Fortemps
Friday 14:00-15:40 FB-2: Heuristics Room Vesale 020 - Chair: T. Stützle
Friday 14:00-15:40 FB-3: COMEX - Transportation Room Vesale 025 - Chair: F. Spieksma
Friday 14:00-15:40 FB-4: Health Room Pentagone 0A11 - Chair: G. Vanden Berghe
- IP Techniques for Nurse Rostering Problem
Tulio Toffolo (KU Leuven) Co-authors: Haroldo G. Santos, Rafael Martinelli, Rafael A.M. Gomes, Greet Vanden Berghe Abstract: This work presents Integer Programming (IP) techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced the following results: the optimality of the vast majority of instances was proved, the best known solutions were improved by up to 15\% and strong dual bounds were obtained.
- Using computer simulation to test a short stay unit
Gilles Sinnaeve (Université Catholique de Louvain) Co-authors: Claire Beguin, Philippe Chevalier & Marianne Philippe
- SIMEDIS disaster management simulator: aeronautical catastrophe
Christophe Ullrich (Royal Military Academy) Co-authors: C. Ullrich, F. Van Utterbeeck, E. Dhondt and M. Debacker
- Integrating patient-to-room assignment planning with elective admission scheduling
Wim Vancroonenburg (KU Leuven) Co-authors: Patrick De Causmaecker, Frits Spieksma, Greet Vanden Berghe
|
|