Introduction to Combinatorial Optimisation in Numberjack

This chapter presents an introduction to combinatorial optimisation in the context of the high-level modelling platform, Numberjack. The process of developing an effective model for a combinatorial problem is presented, along with details on how such problems can be solved using three of the most prominent solution paradigms.

[1]  L. Babai.  Monte-Carlo algorithms in graph isomorphism testing , 2006 .

[2]  Helmut Simonis,et al.  Models for Global Constraint Applications , 2007, Constraints.

[3]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[4]  Barry O'Sullivan,et al.  ReACT: Real-Time Algorithm Configuration through Tournaments , 2014, SOCS.

[5]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..

[6]  Carlos Ansótegui,et al.  A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms , 2009, CP.

[7]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[8]  Barry O'Sullivan,et al.  Grand challenges for constraint programming , 2013, Constraints.

[9]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[10]  Warwick Harvey,et al.  Essence: A constraint language for specifying combinatorial problems , 2007, Constraints.

[11]  J.P. Costas,et al.  A study of a class of detection waveforms having nearly ideal range—Doppler ambiguity properties , 1983, Proceedings of the IEEE.

[12]  Emmanuel Hebrard,et al.  Scheduling Scientific Experiments on the Rosetta/Philae Mission , 2012, CP.

[13]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[14]  G. Nemhauser,et al.  Integer Programming , 2020 .

[15]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[16]  Helmut Simonis,et al.  Constraint Applications in Networks , 2006, Handbook of Constraint Programming.

[17]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[18]  Joël Quinqueton,et al.  Semi-automatic Modeling by Constraint Acquisition , 2003, CP.

[19]  Barry O'Sullivan,et al.  Designing Resilient Long-Reach Passive Optical Networks , 2011, IAAI.

[20]  Ashish Sabharwal,et al.  Exploiting Runtime Variation in Complete Solvers , 2009, Handbook of Satisfiability.

[21]  Grégoire Dooms,et al.  The CP(Graph) computation domain in constraint programming , 2006 .

[22]  Carmen Gervet,et al.  Set Intervals in Constraint Logic Programming: Definition and implementation of a language. (Intervalles ensemblistes en programmation logique par contraintes : définition formelle et concrète d'un langage) , 1995 .

[23]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[24]  Mark Wallace,et al.  Practical applications of constraint programming , 2004, Constraints.

[25]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[26]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[27]  Helmut Simonis,et al.  A Constraint Seeker: Finding and Ranking Global Constraints from Examples , 2011, CP.

[28]  Lars Kotthoff,et al.  A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems , 2011, SOCS.

[29]  Pascal Van Hentenryck,et al.  Generality versus Specificity: An Experience with AI and OR Techniques , 1988, AAAI.

[30]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[31]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[32]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[33]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[34]  Barry O'Sullivan,et al.  The Impact of Search Heuristics on Heavy-Tailed Behaviour , 2006, Constraints.

[35]  Barry O'Sullivan,et al.  Constraint Programming and Combinatorial Optimisation in Numberjack , 2010, CPAIOR.

[36]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[37]  Eugene C. Freuder.  In Pursuit of the Holy Grail , 1996, CSUR.

[38]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[39]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[40]  Barry O'Sullivan,et al.  Lazy Branching for Constraint Satisfaction , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

[41]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[42]  Yue Kwen Justin.  The Length-Lex Representation for Constraint Programming over Sets , 2011 .

[43]  Barry O'Sullivan,et al.  Proteus: A Hierarchical Portfolio of Solvers and Transformations , 2013, CPAIOR.

[44]  Maurizio Gabbrielli,et al.  A Multicore Tool for Constraint Solving , 2015, IJCAI.

[45]  Willem Jan van Hoeve,et al.  Global Constraints , 2006, Handbook of Constraint Programming.

[46]  Lars Kotthoff,et al.  Learning When to Use Lazy Learning in Constraint Solving , 2010, ECAI.

[47]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[48]  Peter J. Stuckey,et al.  Learning Value Heuristics for Constraint Programming , 2015, CPAIOR.

[49]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[50]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[51]  Helmut Simonis,et al.  A Model Seeker: Extracting Global Constraint Models from Positive Examples , 2012, CP.