Upload
bridie
View
45
Download
1
Embed Size (px)
DESCRIPTION
Doctoral Program. Doctoral Program Organizers Christopher Jefferson Universtiy of St Andrews, UK Guido Tack Katholieke Universiteit Leuven , Belgium. Programme Committee Magnus Ågren (Sweden) Lucas Bordeaux (UK) Sebastian Brand (Australia) Andrei Bulatov (Canada) - PowerPoint PPT Presentation
Citation preview
Doctoral Program
September 12, 2011 University of Perugia, Italy
Doctoral Program OrganizersChristopher JeffersonUniverstiy of St Andrews, UKGuido Tack Katholieke Universiteit Leuven, Belgium
Programme CommitteeMagnus Ågren (Sweden)Lucas Bordeaux (UK) Sebastian Brand (Australia)Andrei Bulatov (Canada)Sophie Demassey (France)Stefano Gualandi (Ireland)Inês Lynce (Portugal)Chris Mears (Australia)
Peter Nightingale (UK)Claude-Guy Quimper (Canada) Andrea Rendl (Austria) Horst Samulowitz (USA)Meinolf Sellmann (USA)Willem-Jan van Hoeve (USA)Roland Yap (Singapore)Stinslav Zivny (UK)
08:45 Welcome + Opening08:50 Anna Roubickova. Flexible timeline-based planning and its constraints
09:10 Dario Campagna. A CLP-based System For Custom Product Manufacturing
09:30 Hu Xu. Genetic Based Automatic Congurator for Minion
09:50 Nicholas Downing. Explaining flow-based propagation
10:10 Maria Francisco. Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
10:30 Coffee Break10:55 Arnaud Letort. Cumulatives trajectories: a Constraint for Modelling Preemptive Reassignable Tasks with Momenterily Resource Consumption
11:15 Joseph Scott. A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
11:35 Katherine Lai. The Min Average Latency Steiner Multigraph Problem: Budget-Constrained Wildlife Corridor Design for Multiple Species
11:55 Florence Massen. A Relaxation-Guided Approach for Vehicle Routing Problems with Black Box Feasibility
12:15 Faten Nabli. Finding minimal siphons and traps as a Constraint satisfaction Problem
12:35 Lunch Break14:00 Guillaume Escamocher. Mapping Out the Tractability of 3-Variable Forbidden Patterns
14:20 Matthew Gwynne. Towards a better understanding of hardness
14:40 Markus Aschinger. A new logic-based formalism for Configuration problems
15:00 Silvia Tomasi. Satisfiability Modulo Theory with Cost Optimization
15:20 Walid Trabelsi. Pruning Rules for Constrained Optimisation for Conditional Preferences
15:40 Coffee Break16:10 Samir A. Mohamed Elsayed. Synthesis of Search Algorithms from High-level CP Models
16:30 Natalia Flerova. Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models
16:50 Jean-Baptiste Mairy. Reinforced Adaptive Large Neighborhood Search
17:10 Eoin O'Mahony. Incorporating Variance in Impact-Based Search
17:30 Dario Pacino. Adaptive Randomized Decompositions for Jobshop Scheduling