|
|
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
- Failure Detection for the Bin-Packing Constraint
Julien Dupuis (UCLouvain) Co-authors: Pierre Schaus, Yves Deville
- Finite Domain Modeling and Solving in the Monadic Constraint Programming Framework
Pieter Wuille (KULeuven) Co-authors: Tom Schrijvers
- Constrained Optimum Paths Problems with LS(Graph)
Quang Dung Pham (UCLouvain) Co-authors: Yves DEVILLE, Pascal van HENTENRYCK Abstract: Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. The proposed modeling approach is based on spanning tree in order to simplify the neighborhood computation. We also apply the modeling to the Resource Constrained Shortest Path (RCSP) problem and to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computational results show the significance of the approach.
- On expressing nurse rostering constraints as propositional satisfiability problems
Tommy Messelis (KULeuven Campus Kortrijk) Co-authors: Stefaan Haspeslagh, Patrick De Causmaecker
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
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
|
|