Encoding Linear Constraints into SAT, CP, pp.75-91, 2014. ,
DOI : 10.1007/978-3-319-10428-7_9
Extending chip in order to solve complex scheduling and placement problems, JFPL, p.51, 1992. ,
DOI : 10.1016/0895-7177(93)90068-A
URL : https://hal.archives-ouvertes.fr/hal-00442821
An Introduction to Kernel and Nearest-Neighbor Nonparametric Regression. The American Statistician, pp.175-185, 1992. ,
An Empirical Evaluation of Portfolios Approaches for Solving CSPs, CPAIOR, pp.316-324, 2013. ,
DOI : 10.1007/978-3-642-38171-3_21
URL : https://hal.archives-ouvertes.fr/hal-00909297
An enhanced features extractor for a portfolio of constraint solvers, Proceedings of the 29th Annual ACM Symposium on Applied Computing, SAC '14, pp.1357-1359, 2014. ,
DOI : 10.1145/2554850.2555114
URL : https://hal.archives-ouvertes.fr/hal-01089183
Portfolio Approaches for Constraint Optimization Problems, LION, pp.21-35, 2014. ,
DOI : 10.1007/978-3-319-09584-4_3
URL : https://hal.archives-ouvertes.fr/hal-01088429
Abstract, Theory and Practice of Logic Programming, vol.41, issue.4-5, pp.509-524, 2014. ,
DOI : 10.1007/s10601-008-9051-2
SUNNY-CP, Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC '15, 2015. ,
DOI : 10.1145/2695664.2695741
URL : https://hal.archives-ouvertes.fr/hal-01227589
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers, CP, pp.108-124, 2014. ,
DOI : 10.1007/978-3-319-10428-7_11
URL : https://hal.archives-ouvertes.fr/hal-01091664
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms, CP, pp.142-157, 2009. ,
DOI : 10.1007/BF02430370
Continuous Search in Constraint Programming, ICTAI, pp.53-60, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00515137
A survey of cross-validation procedures for model selection, Statistics Surveys, vol.4, issue.0, pp.40-79, 2010. ,
DOI : 10.1214/09-SS054
URL : https://hal.archives-ouvertes.fr/hal-00407906
PeneLoPe, a Parallel Clause-Freezer Solver, SAT Challenge 2012, pp.43-44, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00865592
Cardinal: A Finite Sets Constraint Solver, Constraints, vol.12, issue.1, pp.93-129, 2007. ,
DOI : 10.1007/s10601-006-9012-6
Representative Encodings to Translate Finite CSPs into SAT, CPAIOR, pp.251-267, 2014. ,
DOI : 10.1007/978-3-319-07046-9_18
Satisfiability Modulo Theories, Handbook of Satisfiability, pp.825-885, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01095009
History of Constraint Programming, 2010. ,
DOI : 10.1002/9780470400531.eorms0382
Approximate Algorithms and Heuristics for MAX-SAT, Handbook of Combinatorial Optimization, pp.77-148 ,
DOI : 10.1007/978-1-4613-0303-9_2
Specification of FlatZinc ? Version 1.6, 2014. ,
Boosting Local Consistency Algorithms over Floating-Point Numbers, CP, CP'12, pp.127-140, 2012. ,
DOI : 10.1007/978-3-642-33558-7_12
Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007. ,
DOI : 10.1007/s10601-006-9010-8
Measuring the impact of primal heuristics. Operations Re- Search Letters, pp.611-614, 2013. ,
A Framework for Combining Set Variable Representations, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01067263
Constraint Solving over Semi-rings, IJCAI, pp.624-630, 1995. ,
Semiring-based constraint satisfaction and optimization, Journal of the ACM, vol.44, issue.2, pp.201-236, 1997. ,
DOI : 10.1145/256303.256306
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3513
Gérard Verfaillie, andHéì ene Fargier. Semiring-Based CSPs and Valued CSPs: Frameworks , Properties, and Comparison, Constraints, vol.4, issue.3, pp.199-240, 1999. ,
DOI : 10.1023/A:1026441215081
Symbolic execution of floating-point computations, Software Testing, Verification and Reliability, vol.14, issue.2, pp.97-121, 2006. ,
DOI : 10.1002/stvr.333
URL : https://hal.archives-ouvertes.fr/inria-00540299
Convex Optimization, 2004. ,
Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, vol.112, issue.1, pp.3-41, 1999. ,
DOI : 10.1016/S0377-2217(98)00204-5
Resolution for Quantified Boolean Formulas, Information and Computation, vol.117, issue.1, pp.12-18, 1995. ,
DOI : 10.1006/inco.1995.1025
Low Knowledge Algorithm Control for Constraint-Based Scheduling, 2009. ,
Low-Knowledge Algorithm Control, AAAI, pp.49-54, 2004. ,
APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS, Computational Intelligence, vol.15, issue.6, pp.372-387, 2005. ,
DOI : 10.1287/ijoc.14.2.98.120
A Meta-Heuristic Factory for Vehicle Routing Problems, CP, pp.144-158, 1999. ,
DOI : 10.1007/978-3-540-48085-3_11
A Constraint-Based Method for Project Scheduling with Time Windows, Journal of Heuristics, vol.8, issue.1, pp.109-136, 2002. ,
DOI : 10.1023/A:1013617802515
SMOTE: Synthetic Minority Over-sampling Technique, Journal of Artificial Intelligence ReSearch, vol.16, 2002. ,
Symmetry Definitions for Constraint Satisfaction Problems, Constraints, vol.129, issue.2-3, pp.115-137, 2006. ,
DOI : 10.1007/s10601-006-8059-8
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints ,
The Complexity of Theorem-Proving Procedures, STOC, pp.151-158, 1971. ,
Symmetry-Breaking Predicates for Search Problems, pp.148-159, 1996. ,
The Truck Dispatching Problem, Management science, vol.6, issue.1, pp.80-91, 1959. ,
Solving Vehicle Routing Problems using Constraint Programming and MetaHeuristics, Journal of Heuristics, vol.6, issue.4, pp.501-523, 2000. ,
DOI : 10.1023/A:1009621410177
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990. ,
DOI : 10.1016/0004-3702(90)90046-3
Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, vol.113, issue.1-2, pp.41-85, 1999. ,
DOI : 10.1016/S0004-3702(99)00059-4
Constraint Processing, 2003. ,
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, CP2005 Proceedings, pp.211-225, 2005. ,
DOI : 10.1007/11564751_18
Sets and constraint logic programming, ACM Transactions on Programming Languages and Systems, vol.22, issue.5, pp.861-931, 2000. ,
DOI : 10.1145/365151.365169
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.1779
Fuzzy constraints in job-shop scheduling, Journal of Intelligent Manufacturing, vol.2, issue.1, pp.215-234, 1995. ,
DOI : 10.1007/BF00128646
Fuzzy Sets and Systems -Theory and Applications . Academic press, 1980. ,
Automatic Algorithm Selection for Complex Simulation Problems ,
DOI : 10.1007/978-3-8348-8151-9
Symmetry Breaking, CP, CP '01, pp.93-107, 2001. ,
DOI : 10.1007/3-540-45578-7_7
Selecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems, Proc. of the 1 s t European Congress on Fuzzy and Intelligent Technologies, 1993. ,
An Interval Constraint Branching Scheme for Lattice Domains, Journal of Universal Computer Science, vol.12, issue.11, pp.1466-1499, 2006. ,
Introducing esra, a Relational Language for Modelling Combinatorial Problems, Proceedings of LOPSTR '03: Revised Selected Papers, pp.214-232, 2004. ,
DOI : 10.1007/978-3-540-25938-1_18
The Traveling-Salesman Problem, Operations ReSearch, vol.4, issue.1, pp.61-75, 1956. ,
Local Search and Constraint Programming, Constraint and Integer Programming, pp.293-329 ,
DOI : 10.1007/978-1-4419-8917-8_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4401
Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978. ,
DOI : 10.1145/359642.359654
URL : http://dspace.mit.edu/handle/1721.1/6247#files-area
Partial Constraint Satisfaction, Artificial Intelligence, vol.58, pp.21-70, 1992. ,
Essence: A constraint language for specifying combinatorial problems, Constraints, vol.12, issue.1, pp.268-306, 2008. ,
DOI : 10.1007/s10601-008-9047-y
Online Dynamic Algorithm Portfolios, 2010. ,
Logic Programming: Further Developments, SLP, pp.88-96, 1985. ,
Performance Measurement and Analysis of Certain Search Algorithms, 1979. ,
Making Choices Using Structure at the Instance Level within a??Case Based Reasoning Framework, CPAIOR, pp.380-386, 2004. ,
DOI : 10.1007/978-3-540-24664-0_27
Efficient Constraint Solving Toolkit ,
Careful Ranking of Multiple Solvers with Timeouts and Ties, SAT, 2011. ,
DOI : 10.1007/978-1-4615-4459-3
Symmetry Breaking in Constraint Programming, Proceedings of ECAI-2000, pp.599-603, 2000. ,
CSPLIB: A Benchmark Library for Constraints ,
Chuffed solver description, 2014. ,
Tabu Search, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-01389283
Constraint Reasoning over Strings, Proceedings of the 9th International Conference on the Principles and Practices of Constraint Programming, pp.377-391, 2003. ,
DOI : 10.1007/978-3-540-45193-8_26
Chapter 2 Satisfiability Solvers, Satisfiability Solvers. Handbook of Knowledge Representation, vol.3, pp.89-134, 2008. ,
DOI : 10.1016/S1574-6526(07)03002-7
Practical Aspects of Algorithm Portfolio Design ,
Algorithm Portfolio Design: Theory vs. Practice, Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence, pp.190-197, 1997. ,
Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001. ,
DOI : 10.1016/S0004-3702(00)00081-3
Heavy-tailed distributions in combinatorial search, CP, pp.121-135, 1997. ,
DOI : 10.1007/BFb0017434
Combinatorial Optimization. Handbook of combinatorics, pp.1541-1597, 1995. ,
Algorithms for the Satisfiability (SAT) Problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.19-152, 1996. ,
DOI : 10.1007/978-1-4757-3023-4_7
A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem, Annals of Operations Research, vol.151, issue.3, pp.61-82, 2007. ,
DOI : 10.1007/s10479-007-0229-6
Cutting Stock Problems and Solution Procedures, European Journal of Operational ReSearch, vol.54, issue.2, pp.141-150, 1991. ,
Learning the k in k-means, NIPS, 2004. ,
Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artif. Intell, vol.14, issue.3, pp.263-313, 1980. ,
Set Bounds and (Split) Set Domain Propagation Using ROBDDs, Australian Conference on Artificial Intelligence, pp.706-717, 2004. ,
DOI : 10.1007/978-3-540-30549-1_61
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.2433
A Hybrid BDD and SAT Finite Domain Constraint Solver, Practical Aspects of Declarative Languages, pp.103-117, 2006. ,
DOI : 10.1007/11603023_8
Encyclopaedia of mathematics, 1988. ,
Constraint Programming and Combinatorial Optimisation in Numberjack, CPAIOR-10, pp.181-185, 2010. ,
DOI : 10.1007/978-3-642-13520-0_22
URL : https://hal.archives-ouvertes.fr/hal-00561698
OFAI clp(q, r) Manual, Edition 1.3.3. Austrian ReSearch Institute for Artificial Intelligence, 1995. ,
Integrated Methods for Optimization (International Series in Operations ReSearch & Management Science), 2006. ,
Advances in Algorithm Selection for Answer Set Programming, pp.569-585, 2014. ,
Robust Benchmark Set Selection for Boolean Constraint Solvers, LNCS, vol.7997, pp.138-152, 2013. ,
An Economics approach to Hard Computational Problems, Science, vol.275, issue.5296, pp.51-54, 1997. ,
Proteus: A Hierarchical Portfolio of Solvers and Transformations, CPAIOR, pp.301-317, 2014. ,
DOI : 10.1007/978-3-319-07046-9_22
Automated Configuration of Algorithms for Solving Hard Computational Problems, 2009. ,
Sequential Model-Based Optimization for General Algorithm Configuration, LION, pp.507-523, 2011. ,
DOI : 10.1007/978-0-387-84858-7
ParamILS: An Automatic Algorithm Configuration Framework, J. Artif. Intell . Res. (JAIR), vol.36, pp.267-306, 2009. ,
Algorithm Runtime Prediction: The State of the Art, 1211. ,
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1996. ,
Algorithm Selection and Scheduling, CP, 2011. ,
DOI : 10.1007/978-3-642-23786-7_35
ISAC ? Instance-Specific Algorithm Configuration, ECAI, 2010. ,
Generalized NoGoods in CSPs, AAAI, pp.390-396, 2005. ,
A Classification-Based Approach to Managing a Solver Portfolio for CSPs, AICS, 2011. ,
Constraint Programming with Multisets, pp.2002-2003 ,
Algorithm Selection for Combinatorial Search Problems: A Survey. CoRR, abs, 1210. ,
Hybrid Regression-Classification Models for Algorithm Selection, ECAI, pp.480-485, 2012. ,
On Algorithm Selection, with an application to combinatorial search problems, Constraints, vol.20, issue.4, 2012. ,
DOI : 10.1007/s10601-015-9214-x
LLAMA: Leveraging Learning to Automatically Manage Algorithms, 2013. ,
An Evaluation of Machine Learning in Algorithm Selection for Search Problems, pp.257-270, 2012. ,
Feature Filtering for Instance-Specific Algorithm Configuration, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, pp.849-855, 2011. ,
DOI : 10.1109/ICTAI.2011.132
Algorithms for Constraint-Satisfaction Problems: A Survey, pp.32-44, 1992. ,
An Automatic Method of Solving Discrete Programming Problems, Econometrica: Journal of the Econometric Society, pp.497-520, 1960. ,
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions, CP, pp.556-572, 2002. ,
DOI : 10.1007/3-540-46135-3_37
What Is Answer Set Programming?, 2008. ,
Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977. ,
DOI : 10.1016/0004-3702(77)90007-8
Instance-Specific Algorithm Configuration, 2012. ,
DOI : 10.1007/978-3-319-11230-5_3
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering, IJ- CAI. IJCAI/AAAI, 2013. ,
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering, IJ- CAI. IJCAI/AAAI, 2013. ,
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction, pp.153-167, 2013. ,
DOI : 10.1007/978-3-642-44973-4_17
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation, CPAIOR, 2012. ,
DOI : 10.1007/978-3-642-29828-8_16
The Design of the Zinc Modelling Language, Constraints, vol.84, issue.1, pp.229-267, 2008. ,
DOI : 10.1007/s10601-008-9041-4
Principles of Artificial lntelligence, Artif. Intell, vol.15, issue.12, pp.127-131, 1980. ,
Solving Constraints over Floating-Point Numbers, 2001. ,
DOI : 10.1007/3-540-45578-7_36
Integrating Operations Research in Constraint Programming, Annals of Operations Research, vol.11, issue.3, pp.37-76, 2010. ,
DOI : 10.1007/s10479-009-0654-9
Machine Learning. McGraw Hill series in computer science, 1997. ,
Solving XCSP Problems by using Gecode, CILC, 2011. ,
Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001. ,
DOI : 10.1145/378239.379017
Linear Complementarity, Linear and Nonlinear Programming, 1988. ,
The (Dantzig) Simplex Method for Linear Programming, Computing in Science & Engineering, vol.2, issue.1, pp.29-31, 2000. ,
Converting MiniZinc to FlatZinc -Version 1.6 http ,
MiniZinc: Towards a Standard CP Modelling Language, LNCS, vol.4741, pp.529-543, 2007. ,
DOI : 10.1007/978-3-540-74970-7_38
Instance-Based Selection of Policies for SAT Solvers, SAT, pp.326-340 ,
DOI : 10.1007/978-3-540-74970-7_50
Constraint-Based Job Shop Scheduling with IILOG SCHEDULER, Journal of Heuristics, vol.3, issue.4, pp.271-286, 1998. ,
DOI : 10.1023/A:1009687210594
Propagation via lazy clause generation, Constraints, vol.37, issue.1???3, pp.357-391, 2009. ,
DOI : 10.1007/s10601-008-9064-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8691
Using case-based reasoning in an algorithm portfolio for constraint solving, AICS, vol.08, 2009. ,
A view of local search in constraint programming, CP, pp.353-366, 1996. ,
DOI : 10.1007/3-540-61551-2_86
Interior-Point Methods, Journal of Computational and Applied Mathematics, vol.124, issue.1, pp.281-302, 2000. ,
A Multi-engine Solver for Quantified Boolean Formulas, CP, pp.574-589, 2007. ,
DOI : 10.1007/978-3-540-74970-7_41
A self-adaptive multi-engine solver for quantified Boolean formulas, Constraints, vol.2, issue.1, pp.80-116, 2009. ,
DOI : 10.1007/s10601-008-9051-2
Generalized Arc Consistency for Global Cardinality Constraint, AAAI, pp.209-215, 1996. ,
The Algorithm Selection Problem, Advances in Computers, vol.15, pp.65-118, 1976. ,
DOI : 10.1016/S0065-2458(08)60520-3
Tractable Symmetry Breaking Using Restricted Search Trees, ECAI, pp.211-215, 2004. ,
XML Representation of Constraint Networks: Format XCSP 2.1. CoRR, abs/0902, p.2362, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00872825
Insights into Parallelism with Intensive Knowledge Sharing, CP, pp.655-671, 2014. ,
DOI : 10.1007/978-3-319-10428-7_48
Enhancing set constraint solvers with lexicographic bounds, Journal of Heuristics, vol.47, issue.34, pp.23-67, 2008. ,
DOI : 10.1007/s10732-007-9028-0
Snappy: A Simple Algorithm Portfolio, SAT, pp.422-428, 2013. ,
DOI : 10.1007/978-3-642-39071-5_33
Possibilistic Constraint Satisfaction Problems or ???How to handle soft constraints????, Proc. 8th Conf. of Uncertainty in AI, pp.269-275, 1992. ,
DOI : 10.1016/B978-1-4832-8287-9.50041-4
Valued Constraint Satisfaction Problems: Hard and Easy Problems, IJCAI, pp.631-637 ,
Combinatorial Optimization: Polyhedra and Efficiency, 2003. ,
Solving RCPSP/max by lazy clause generation, Journal of Scheduling, vol.16, issue.3, pp.273-289, 2013. ,
DOI : 10.1007/s10951-012-0285-x
Hill-Climbing Search. Encyclopedia of Cognitive Science ,
DOI : 10.1002/0470018860.s00015
A New Method for Solving Hard Satisfiability Problems, AAAI, pp.440-446, 1992. ,
Cross-disciplinary perspectives on meta-learning for algorithm selection, ACM Computing Surveys, vol.41, issue.1, 2008. ,
DOI : 10.1145/1456650.1456656
Heuristics for Dynamically Adapting Propagation in Constraint Satisfaction Problems, AI Commun, vol.22, issue.3, pp.125-141, 2009. ,
Instance-Based Selection of CSP Solvers using Short Training, Pragmatics of SAT, 2014. ,
meSAT: multiple encodings of CSP to SAT, Constraints, vol.32, issue.2, pp.380-403, 2014. ,
DOI : 10.1007/s10601-014-9165-7
Using Online Algorithms to solve NP-hard Problems More Efficiently in Practice, 2007. ,
Philosophy of the MiniZinc challenge, Constraints, vol.15, issue.3, pp.307-316, 2010. ,
The MiniZinc Challenge, pp.55-60, 2008. ,
Compiling finite linear CSP into SAT, Constraints, vol.64, issue.2, pp.254-272, 2009. ,
DOI : 10.1007/s10601-008-9061-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.5103
Combinatorial optimization through statistical instance-based learning, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001, pp.203-209, 2001. ,
DOI : 10.1109/ICTAI.2001.974466
The OPL Optimization Programming Language, 1999. ,
Consistency and Propagation with Multiset Constraints: A Formal Viewpoint, CP, 2003. ,
DOI : 10.1007/978-3-540-45193-8_49
A practical guide to support vector classification, 2010. ,
The Lack of a Priori Distinctions Between Learning Algorithms, Neural Computation, vol.8, issue.7, pp.1341-1390, 1996. ,
No Free Lunch Theorems for Optimization, Evolutionary Computation IEEE Transactions on, vol.1, issue.1, pp.67-82, 1997. ,
Hydra, Proceedings of the 2005 ACM workshop on Storage security and survivability , StorageSS '05, 2010. ,
DOI : 10.1145/1103780.1103797
Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors, SAT, pp.228-241, 2012. ,
DOI : 10.1007/978-3-642-31612-8_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.2384
SATzilla: Portfolio-Based Algorithm Selection for SAT, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008. ,
Hydra- MIP: Automated Algorithm Configuration and Selection for Mixed Integer Programming, RCRA (workshop), 2011. ,
Improved Algorithm Selection Based on Cost-Sensitive Classification Models. Solver description, SAT Challenge, 2012. ,