Program > Overview

Week Mon. 18 Tue. 19 Wed. 20 List

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

Online user: 1