Program > Overview
| Time |
Event |
|
|
12:30 - 13:30
|
Welcome buffet and registration |
|
|
13:30 - 14:00
|
Opening session - Welcome speech and overall indications |
|
|
14:00 - 14:40
|
The Convex Hull Heuristic for Nonlinear 0-1 Programming Problems with Linear Constraints - Monique Guignard-Spielberg |
|
|
14:40 - 15:20
|
Matheuristics for column generation stabilization: application to a technician routing and scheduling problem - Nicolas Dupin |
|
|
15:20 - 16:00
|
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem - Federico Della Croce |
|
|
16:00 - 16:30
|
Coffee break |
|
|
16:30 - 17:10
|
A Matheuristic for the combined Master Surgical Scheduling and Surgical Cases Assignment problem with Bed Levelling - Simona Mancini |
|
|
17:10 - 17:50
|
A set partitioning heuristic for the home health care routing and scheduling problem - Florian Grenouilleau |
|
|
18:30 - 20:30
|
Cocktail - Guinguette de Tours |
|
| Time |
Event |
|
|
09:00 - 10:00
|
Hybrid Optimization: The Many Marriages of CP, MP, and SAT - Pascal Van Hentenryck |
|
|
10:00 - 10:30
|
Coffee break |
|
|
10:30 - 11:10
|
Constructive matheuritic for container loading with complex practical constraints - Vittorio Maniezzo |
|
|
11:10 - 11:50
|
Pattern based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers - Ruslan Sadykov |
|
|
11:50 - 12:30
|
A matheuristic approach for the design of multiproduct batch plants with parallel production lines - Floor Verbiest |
|
|
12:30 - 14:00
|
Lunch |
|
|
14:00 - 22:00
|
Excursion and dinner - Visit to Château de Chenonceau
Visit to the Saint Roch wine cellar
Dinner at "La Cave" restaurant |
|
| Time |
Event |
|
|
09:00 - 10:00
|
Xpress Mosel - modern ways of developing mathematical optimization applications - Sebatien Lannez |
|
|
10:00 - 10:30
|
Coffee break |
|
|
10:30 - 11:10
|
Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing - Alexandre Biele |
|
|
11:10 - 11:50
|
Finding Alternative Solutions of Interest for the Cross-Dock Door Assignment (CDAP) Problem - Steven Kimbrough |
|
|
11:50 - 12:30
|
Efficient and simple heuristics for the Aircraft Landing Problem - Amir Salehipour |
|
|
12:30 - 14:00
|
Lunch |
|
|
14:00 - 14:40
|
Solving a special case of the Graph Edit Distance Problem with Local Branching - Mostafa Darwiche |
|
|
14:40 - 15:20
|
Analysis of a Constructive Matheuristic for the Traveling Umpire Problem - Reshman C. Chandrasekharan |
|
|
15:20 - 16:00
|
Closing session - Farewell speech |
|
|
