Constraint Programming (CP) is a powerful set of techniques to model and solve combinatorial problems, which are ubiquitous in academia and industry. The last ten years or so have witnessed significant research devoted to modelling and solving problems with constraints. CP has been successfully used for tackling a wide range of real-life complex applications, however finding a good model of a given problem often requires considerable expertise and time. The key goals of this workshop are to extend the understanding of constraint modelling, and to automate aspects of modelling or model reformulation to extend the reach of constraint solvers on difficult problems and ease the task of modelling. We solicit original papers that contribute to either or both of these goals. Workshop topics include:
Application papers describing interesting problems and interesting ways to model them;
Contributions to understanding modelling that could guide the manual or automatic formulation of models;
Identification of the criteria that should be used in evaluating models and the design of pragmatic techniques that facilitate the choice and possibly combination among alternative models;
Design of higher-level modelling languages;
Automatic reformulation techniques.
|Notification of acceptance/rejection:||August 10th, 2015|
|Camera ready version:||August 24th, 2015|
|Workshop day:||August 31st, 2015|
|10:30 - 11:00||Alan Frisch and Miquel Palahí.
Feasibility of Building Better Traincrew Rosters with Complete Solvers
|11:00 - 11:30||Alexander Schiendorfer, Benedikt Eberhardinger, Michael Wißner, Wolfgang Reif and Elisabeth André.
Back-to-Back Testing a Soft Constraint Model for a Smart Exhibition Space
|11:30 - 12:00||Tias Guns, Anton Dries, Guido Tack, Siegfried Nijssen and Luc De Raedt.
Automatic solver chaining in MiningZinc
|12:00 - 13:30||Lunch break|
|13:30 - 14:00||Lars Kotthoff, Barry O'Sullivan, S. S. Ravi and Ian Davidson.
Complex Clustering Using Constraint Programming: Modelling Electoral Map Creation
|14:00 - 14:30||Gleb Belov, Guido Tack and Mark Wallace.
Updated Linearization Library for MiniZinc 2.0
|14:30 - 15:00||Jo Devriendt, Patrick De Causmaecker and Marc Denecker.
Transforming Constraint Programs to Input for Local Search
|15:00 - 15:30||Coffee break|
|15:30 - 16:30||Invited talk: Christian Schulte.
Modeling and Solving Code Generation for Real
|16:30 - 17:00||Invited talk: Chris Mears.
Towards Automatic Dominance Detection in Constraint Optimisation Problems
|(chair)||Ozgur Akgun||University of St Andrews|
|(chair)||Peter Nightingale||University of St Andrews|
|David Bergman||University of Connecticut|
|Alan Frisch||University of York|
|Brahim Hnich||Taif University|
|Jimmy Lee||The Chinese University of Hong Kong|
|Chris Mears||Monash University|
|Karen Petrie||University of Dundee|
|Steven Prestwich||University College Cork|
|Helmut Simonis||University College Cork|
|Peter Stuckey||University of Melbourne|
Submissions must be formatted in the Lecture Notes in Computer Science (LNCS) style and must be within 15 pagesexcluding references. Submissions of shorter papers, including position papers, are welcome.
Papers must be submitted in PDF format using EasyChair.
All submissions will be reviewed and those that are well-written and make a worthwhile contribution to the topic of the workshop will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at CP 2015. At least one author of each accepted paper must attend the workshop. Please note that every workshop participant needs to be registered for the workshop.
Past events of this workshop series can be found here.