| Efficient Operations Between MDDs and Constraints | 0 | 0.34 | 2022 |
| Parallelization of TSP Solving in CP. | 0 | 0.34 | 2020 |
| Improved filtering for the bin-packing with cardinality constraint. | 0 | 0.34 | 2018 |
| Parallel Algorithms for Operations on Multi-Valued Decision Diagrams. | 0 | 0.34 | 2018 |
| Mdds: Sampling And Probability Constraints | 1 | 0.35 | 2017 |
| Soft and Cost MDD Propagators. | 1 | 0.36 | 2017 |
| Embarrassingly Parallel Search in Constraint Programming. | 0 | 0.34 | 2016 |
| Enforcing Structure On Temporal Sequences: The Allen Constraint | 3 | 0.40 | 2016 |
| Constructions And In-Place Operations For Mdds Based Constraints | 3 | 0.38 | 2016 |
| Parallel Strategies Selection | 3 | 0.41 | 2016 |
| Compact-Table: Efficiently Filtering Table Constraints With Reversible Sparse Bit-Sets | 6 | 0.45 | 2016 |
| Mixing Static and Dynamic Partitioning to Parallelize a Constraint Programming Solver. | 1 | 0.34 | 2016 |
| Relations between MDDs and Tuples and Dynamic Modifications of MDDs based constraints | 0 | 0.34 | 2015 |
| Efficient Operations On MDDs for Building Constraint Programming Models. | 5 | 0.42 | 2015 |
| Generating all Possible Palindromes from Ngram Corpora. | 1 | 0.36 | 2015 |
| Bound-consistent spread constraint | 1 | 0.39 | 2014 |
| The Package Server Location Problem. | 0 | 0.34 | 2013 |
| Improved filtering for weighted circuit constraints | 9 | 0.47 | 2012 |
| Cardinality reasoning for bin-packing constraint: application to a tank allocation problem | 5 | 0.47 | 2012 |
| An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization | 0 | 0.34 | 2012 |
| A Θ(n) bound-consistency algorithm for the increasing sum constraint | 4 | 0.49 | 2011 |
| Using hard constraints for representing soft constraints | 0 | 0.34 | 2011 |
| Discussion about Constraint Programming Bin Packing Models. | 6 | 0.53 | 2011 |
| Solving problems with CP: four common pitfalls to avoid | 1 | 0.35 | 2011 |
| The Ordered Distribute Constraint | 2 | 0.40 | 2010 |
| Improving the held and karp approach with constraint programming | 2 | 0.38 | 2010 |
| The weighted spanning tree constraint revisited | 7 | 0.45 | 2010 |
| Scalable Load Balancing in Nurse to Patient Assignment Problems | 18 | 1.09 | 2009 |
| Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint | 8 | 0.57 | 2008 |
| The Deviation Constraint | 9 | 0.66 | 2007 |
| Open constraints in a closed world | 10 | 0.63 | 2006 |
| An optimal coarse-grained arc consistency algorithm | 95 | 3.22 | 2005 |
| A fast arc consistency algorithm for n-ary constraints | 28 | 1.45 | 2005 |
| Combination of among and cardinality constraints | 8 | 0.73 | 2005 |
| SPREAD: A Balancing Constraint Based on Statistics | 25 | 1.77 | 2005 |
| Inequality-sum: a global constraint capturing the objective function | 5 | 0.62 | 2005 |
| Maintaining arc consistency algorithms during the search without additional space cost | 5 | 0.68 | 2005 |
| AC-*: A configurable, generic and adaptive arc consistency algorithm | 4 | 0.64 | 2005 |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings | 5 | 0.66 | 2004 |
| The Cardinality Matrix Constraint | 16 | 0.80 | 2004 |
| Using constraint programming to solve the maximum clique problem | 18 | 0.96 | 2003 |
| Résolution d'un problème de conception de réseau avec Parallel Solver | 1 | 0.51 | 2002 |
| Range-Based Algorithm for Max-CSP | 7 | 0.67 | 2002 |
| Robust and Parallel Solving of a Network Design Problem | 11 | 0.95 | 2002 |
| Representation of soft constraints by hard constraints | 2 | 0.44 | 2002 |
| Cost-Based Arc Consistency for Global Cardinality Constraints | 25 | 1.36 | 2002 |
| Specific Filtering Algorithms for Over-Constrained Problems | 45 | 1.77 | 2001 |
| New Lower Bounds of Constraint Violations for Over-Constrained Problems | 8 | 0.62 | 2001 |
| Refining the Basic Constraint Propagation Algorithm | 82 | 4.57 | 2001 |
| A Global Constraint Combining a Sum Constraint and Difference Constraints | 13 | 0.97 | 2000 |
