|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Show all the abstracts
Thursday 11:00:00 Timetabling in education and sport Room 126 - Chair: G. Vanden Berghe
Thursday 11:00:00 Transportation management Room 130 - Chair: F. Semet
Thursday 11:00:00 Networks Room 138 - Chair: B. Fortz
Thursday 11:00:00 Nonconvex optimization 1 Room 035 - Chair: F. Bach
Thursday 14:00:00 Constraint programming models 1 Room 126 - Chair: Y. Deville
Thursday 14:00:00 Vehicle routing Room 130 - Chair: S. Limbourg
Thursday 14:00:00 Combinatorial optimization and IP applications Room 138 - Chair: Q. Louveaux
Thursday 14:00:00 Nonconvex Optimization 2 Room 035 - Chair: R. Sepulchre
Thursday 16:10:00 Constraint programming models 2 Room 126 - Chair: P. Schaus
Thursday 16:10:00 Performance modeling Room 130 - Chair: G. Janssens
Thursday 16:10:00 Scheduling Room 138 - Chair: K. Sorensen
Thursday 16:10:00 Planning under uncertainty Room 035 - Chair: R. Leus
Friday 09:00:00 Metaheuristics Room 126 - Chair: J. Teghem
Friday 09:25:00 Production and distribution (9:25) Room 130 - Chair: Y. Arda
Friday 09:00:00 Multiple criteria Room 138 - Chair: R. Bisdorff
Friday 09:25:00 Stochastic models (9:25) Room 035 - Chair: L. Esch
Friday 11:00:00 Constraint programming and Supply Chain Management Room 126 - Chair: Y. Deville
Friday 11:00:00 OR in health management Room 130 - Chair: P. De Causmaecker
- Modelling questions in nurse rostering
Burak Bilgin (Kaho Sint-Lieven) Co-authors: Patrick De Causmaecker, Greet Vanden Berghe
- Simulation study of outpatient scheduling with unpunctual patients
Thomas Demoor (Ghent University) Co-authors: Dieter Fiems and Herwig Bruneel
- Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
Céline Engelbeen (Université Libre de Bruxelles) Co-authors: Antje Kiesel Abstract: In the present paper we consider a particular case of the segmentation problem arising in the elaboration of radiation therapy plans. This problem consists in decomposing an integer matrix $A$ into a nonnegative integer linear combination of some particular binary matrices called segments which represent fields that are deliverable with a multileaf collimator. For the radiation therapy context, it is desirable to find a decomposition that minimizes the beam-on time, that is the sum of the coefficients (beam-on time problem) of the decomposition. This minimization problem under the condition that the used segments have to respect the tongue-and-groove constraint has already been studied. There exist exact algorithms for particular cases as well as heuristics for the general one. But the complexity of the problem is still unknown. We prove that this last problem is polynomially solvable for binary input matrices and provide a polynomial procedure that finds such a decomposition with minimal beam-on time.
- Evaluating the impact of case mix decisions on capacity utilizations through discrete-event simulation
Guoxuan Ma (K.U. Leuven) Co-authors: Erik Demeulemeester
Friday 11:00:00 Rankings and importance indices Room 138 - Chair: JL. Marichal
Friday 11:00:00 Queueing Room 035 - Chair: S. Wittevrongel
Friday 15:10:00 Optimization software Room 126 - Chair: E. Loute
Friday 15:10:00 Integrated operations planning Room 130 - Chair: B. Raa
Friday 15:10:00 Cycles in graphs Room 138 - Chair: F. Spieksma
|
|