Bound-Consistent Deviation Constraint. - Pierre Schaus; Yves Deville; Pierre Dupont (CP, 2007)

The Deviation Constraint. - Pierre Schaus; Yves Deville; Pierre Dupont; Jean-Charles Régin (CPAIOR, 2007)

A Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem. - Pierre Schaus; Yves Deville (AAAI, 2008)

Scalable Load Balancing in Nurse to Patient Assignment Problems. - Pierre Schaus; Pascal Van Hentenryck; Jean-Charles Régin (CPAIOR, 2009)

Solving balancing and bin-packing problems with constraint programming. - Pierre Schaus (2009)

Consistency Check for the Bin Packing Constraint Revisited. - Julien Dupuis; Pierre Schaus; Yves Deville (CPAIOR, 2010)

Revisiting the Soft Global Cardinality Constraint. - Pierre Schaus; Pascal Van Hentenryck; Alessandro Zanarini (CPAIOR, 2010)

Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS. - Pierre Schaus; Pascal Van Hentenryck; Jean-Noël Monette; Carleton Coffrin; Laurent Michel; Yves Deville (Constraints An Int. J., 2011)

Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem. - Pierre Schaus; Jean-Charles Régin; Rowan Van Schaeren; Wout Dullaert; Birger Raa (CP, 2012)

Revisiting the Cardinality Reasoning for BinPacking Constraint. - François Pelsser; Pierre Schaus; Jean-Charles Régin (CP, 2013)

Multi-Objective Large Neighborhood Search. - Pierre Schaus; Renaud Hartert (CP, 2013)

Variable Objective Large Neighborhood Search: A Practical Approach to Solve Over-Constrained Problems. - Pierre Schaus (ICTAI, 2013)

A Support-Based Algorithm for the Bi-Objective Pareto Constraint. - Renaud Hartert; Pierre Schaus (AAAI, 2014)

Continuous Casting Scheduling with Constraint Programming. - Steven Gay; Pierre Schaus; Vivian De Smedt (CP, 2014)

The StockingCost Constraint. - Vinasétan Ratheil Houndji; Pierre Schaus; Laurence A. Wolsey; Yves Deville (CP, 2014)

Cost Impact Guided LNS. - Michele Lombardi 001; Pierre Schaus (CPAIOR, 2014)

Bound-consistent spread constraint. - Pierre Schaus; Jean-Charles Régin (EURO J. Comput. Optim., 2014)

The Unary Resource with Transition Times. - Cyrille Dejemeppe; Sascha Van Cauwelaert; Pierre Schaus (CP, 2015)

Conflict Ordering Search for Scheduling Problems. - Steven Gay; Renaud Hartert; Christophe Lecoutre; Pierre Schaus (CP, 2015)

Simple and Scalable Time-Table Filtering for the Cumulative Constraint. - Steven Gay; Renaud Hartert; Pierre Schaus (CP, 2015)

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques. - Renaud Hartert; Pierre Schaus; Stefano Vissicchio; Olivier Bonaventure (CP, 2015)

Understanding the Potential of Propagators. - Sascha Van Cauwelaert; Michele Lombardi 001; Pierre Schaus (CPAIOR, 2015)

Derivative-Free Optimization: Lifting Single-Objective to Multi-Objective Algorithm. - Cyrille Dejemeppe; Pierre Schaus; Yves Deville (CPAIOR, 2015)

Time-Table Disjunctive Reasoning for the Cumulative Constraint. - Steven Gay; Renaud Hartert; Pierre Schaus (CPAIOR, 2015)

A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks. - Renaud Hartert; Stefano Vissicchio; Pierre Schaus; Olivier Bonaventure; Clarence Filsfils; Thomas Telkamp; Pierre François (SIGCOMM, 2015)

Verification of railway interlocking systems. - Simon Busard; Quentin Cappart; Christophe Limbrée; Charles Pecheur; Pierre Schaus (ESSS, 2015)

Efficient Filtering for the Unary Resource with Family-Based Transition Times. - Sascha Van Cauwelaert; Cyrille Dejemeppe; Jean-Noël Monette; Pierre Schaus (CP, 2016)

Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. - Jordan Demeulenaere; Renaud Hartert; Christophe Lecoutre; Guillaume Perez; Laurent Perron; Jean-Charles Régin; Pierre Schaus (CP, 2016)

Parallel Strategies Selection. - Anthony Palmieri; Jean-Charles Régin; Pierre Schaus (CP, 2016)

Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing. - Cyrille Dejemeppe; Olivier Devolder; Victor Lecomte; Pierre Schaus (CPAIOR, 2016)

An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming. - John O. R. Aoga; Tias Guns; Pierre Schaus (ECML/PKDD (2), 2016)

A Dedicated Algorithm for Verification of Interlocking Systems. - Quentin Cappart; Pierre Schaus (SAFECOMP, 2016)

Extending Compact-Table to Negative and Short Tables. - Hélène Verhaeghe; Christophe Lecoutre; Pierre Schaus (AAAI, 2017)

CoverSize: A Global Constraint for Frequency-Based Itemset Mining. - Pierre Schaus; John O. R. Aoga; Tias Guns (CP, 2017)

Extending Compact-Table to Basic Smart Tables. - Hélène Verhaeghe; Christophe Lecoutre; Yves Deville; Pierre Schaus (CP, 2017)

Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables. - Quentin Cappart; Pierre Schaus (CPAIOR, 2017)

The Weighted Arborescence Constraint. - Vinasétan Ratheil Houndji; Pierre Schaus; Mahouton Norbert Hounkonnou; Laurence A. Wolsey (CPAIOR, 2017)

Verification of Interlocking Systems Using Statistical Model Checking. - Quentin Cappart; Christophe Limbrée; Pierre Schaus; Jean Quilbeuf; Louis-Marie Traonouez; Axel Legay (HASE, 2017)

Efficient Reification of Table Constraints. - Minh Thanh Khong; Yves Deville; Pierre Schaus; Christophe Lecoutre (ICTAI, 2017)

Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum. - Vincent Branders; Pierre Schaus; Pierre Dupont (NFMCP@PKDD/ECML, 2017)

Mining Time-constrained Sequential Patterns with Constraint Programming. - John O. R. Aoga; Tias Guns; Pierre Schaus (Constraints An Int. J., 2017)

Efficient filtering for the Resource-Cost AllDifferent constraint. - Sascha Van Cauwelaert; Pierre Schaus (Constraints An Int. J., 2017)

A Visual Web Tool to Perform What-If Analysis of Optimization Approaches. - Sascha Van Cauwelaert; Michele Lombardi 001; Pierre Schaus (CoRR, 2017)

Mining a Sub-Matrix of Maximal Sum. - Vincent Branders; Pierre Schaus; Pierre Dupont (CoRR, 2017)

REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms. - Steven Gay; Pierre Schaus; Stefano Vissicchio (CoRR, 2017)

A Constraint Programming Approach for Solving Patient Transportation Problems. - Quentin Cappart; Charles Thomas 005; Pierre Schaus; Louis-Martin Rousseau (CP, 2018)

EpisodeSupport: A Global Constraint for Mining Frequent Patterns in a Long Sequence of Events. - Quentin Cappart; John O. R. Aoga; Pierre Schaus (CPAIOR, 2018)

Soft-Regular with a Prefix-Size Violation Measure. - Minh Thanh Khong; Christophe Lecoutre; Pierre Schaus; Yves Deville (CPAIOR, 2018)

Revisiting the Self-adaptive Large Neighborhood Search. - Charles Thomas 005; Pierre Schaus (CPAIOR, 2018)

Finding Probabilistic Rule Lists using the Minimum Description Length Principle. - John O. R. Aoga; Tias Guns; Siegfried Nijssen; Pierre Schaus (DS, 2018)

Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets. - Hélène Verhaeghe; Christophe Lecoutre; Pierre Schaus (IJCAI, 2018)

How efficient is a global constraint in practice? - A fair experimental framework. - Sascha Van Cauwelaert; Michele Lombardi 001; Pierre Schaus (Constraints An Int. J., 2018)

Improved filtering for the bin-packing with cardinality constraint. - Guillaume Derval; Jean-Charles Régin; Pierre Schaus (Constraints An Int. J., 2018)

Testing Global Constraints. - Aurélie Massart; Valentin Rombouts; Pierre Schaus (CoRR, 2018)

Modeling Pattern Set Mining Using Boolean Circuits. - John O. R. Aoga; Siegfried Nijssen; Pierre Schaus (CP, 2019)

SolverCheck: Declarative Testing of Constraints. - Xavier Gillard; Pierre Schaus; Yves Deville (CP, 2019)

The Maximum Weighted Submatrix Coverage Problem: A CP Approach. - Guillaume Derval; Vincent Branders; Pierre Dupont; Pierre Schaus (CPAIOR, 2019)

Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams. - Hélène Verhaeghe; Christophe Lecoutre; Pierre Schaus (CPAIOR, 2019)

Mining a Maximum Weighted Set of Disjoint Submatrices. - Vincent Branders; Guillaume Derval; Pierre Schaus; Pierre Dupont (DS, 2019)

CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation. - Mathieu Jadin; Francois Aubry; Pierre Schaus; Olivier Bonaventure (INFOCOM, 2019)

An Aggregate Learning Approach for Interpretable Semi-supervised Population Prediction and Disaggregation Using Ancillary Data. - Guillaume Derval; Frédéric Docquier; Pierre Schaus (ECML/PKDD (3), 2019)

Identifying gene-specific subgroups: an alternative to biclustering. - Vincent Branders; Pierre Schaus; Pierre Dupont (BMC Bioinform., 2019)

The item dependent stockingcost constraint. - Vinasétan Ratheil Houndji; Pierre Schaus; Laurence A. Wolsey (Constraints An Int. J., 2019)

Learning Optimal Decision Trees Using Caching Branch-and-Bound Search. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (AAAI, 2020)

Constraint Programming for an Efficient and Flexible Block Modeling Solver. - Alex Lucía Mattenet; Ian Davidson; Siegfried Nijssen; Pierre Schaus (AAAI, 2020)

Insertion Sequence Variables for Hybrid Routing and Scheduling Problems. - Charles Thomas 005; Roger Kameugne; Pierre Schaus (CPAIOR, 2020)

Mining Constrained Regions of Interest: An Optimization Approach. - Alexandre Dubray; Guillaume Derval; Siegfried Nijssen; Pierre Schaus (DS, 2020)

PyDL8.5: a Library for Learning Optimal Decision Trees. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (IJCAI, 2020)

Ddo, a Generic and Efficient Framework for MDD-Based Optimization. - Xavier Gillard; Pierre Schaus; Vianney Coppé (IJCAI, 2020)

Learning Optimal Decision Trees using Constraint Programming (Extended Abstract). - Hélène Verhaeghe; Siegfried Nijssen; Gilles Pesant; Claude-Guy Quimper; Pierre Schaus (IJCAI, 2020)

Learning optimal decision trees using constraint programming. - Hélène Verhaeghe; Siegfried Nijssen; Gilles Pesant; Claude-Guy Quimper; Pierre Schaus (Constraints An Int. J., 2020)

An LSTM approach to Predict Migration based on Google Trends. - Nicolas Golenvaux; Pablo Gonzalez Alvarez; Harold Silvère Kiossou; Pierre Schaus (CoRR, 2020)

Using an interpretable Machine Learning approach to study the drivers of International Migration. - Harold Silvère Kiossou; Yannik Schenk; Frédéric Docquier; Vinasétan Ratheil Houndji; Siegfried Nijssen; Pierre Schaus (CoRR, 2020)

An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities. - Sascha Van Cauwelaert; Cyrille Dejemeppe; Pierre Schaus (J. Sched., 2020)

Improving the Filtering of Branch-and-Bound MDD Solver. - Xavier Gillard; Vianney Coppé; Pierre Schaus; André Augusto Ciré (CPAIOR, 2021)

Assessing Optimal Forests of Decision Trees. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (ICTAI, 2021)

A Seriation Based Framework to Visualize Multiple Aspects of Road Transport from GPS Trajectories. - Alexandre Dubray; Siegfried Nijssen; Isabelle Thomas; Pierre Schaus (ITSC, 2021)

Improving the filtering of Branch-And-Bound MDD solver (extended). - Xavier Gillard; Vianney Coppé; Pierre Schaus; André Augusto Ciré (CoRR, 2021)

Generic Constraint-based Block Modeling using Constraint Programming. - Alex Mattenet; Ian Davidson; Siegfried Nijssen; Pierre Schaus (J. Artif. Intell. Res., 2021)

MiniCP: a lightweight solver for constraint programming. - Laurent D. Michel; Pierre Schaus; Pascal Van Hentenryck (Math. Program. Comput., 2021)

Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CP, 2022)

Sequence Variables for Routing Problems. - Augustin Delecluse; Pierre Schaus; Pascal Van Hentenryck (CP, 2022)

Optimal Decoding of Hidden Markov Models with Consistency Constraints. - Alexandre Dubray; Guillaume Derval; Siegfried Nijssen; Pierre Schaus (DS, 2022)

Large Neighborhood Search with Decision Diagrams. - Xavier Gillard; Pierre Schaus (IJCAI, 2022)

From Inductive Databases to DL8.5 (short paper). - Siegfried Nijssen; Pierre Schaus (KDID, 2022)

Learning Optimal Decision Trees Under Memory Constraints. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (ECML/PKDD (5), 2022)

Time Constrained DL8.5 Using Limited Discrepancy Search. - Harold Silvère Kiossou; Pierre Schaus; Siegfried Nijssen; Vinasétan Ratheil Houndji (ECML/PKDD (5), 2022)

A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). - Vianney Coppé; Pierre Schaus (SOCS, 2022)

Branch-and-Bound with Barrier: Dominance and Suboptimality Detection for DD-Based Branch-and-Bound. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CoRR, 2022)

Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach. - Guillaume Derval; Pierre Schaus (Eur. J. Oper. Res., 2022)

Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CP, 2023)

Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses. - Alexandre Dubray; Pierre Schaus; Siegfried Nijssen (CP, 2023)

Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper). - Nicolas Golenvaux; Xavier Gillard; Siegfried Nijssen; Pierre Schaus (CP, 2023)

Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming (Short Paper). - Augustin Delecluse; Pierre Schaus (CP, 2024)

Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference. - Alexandre Dubray; Pierre Schaus; Siegfried Nijssen (CP, 2024)

An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis. - Auguste Burlats; Pierre Schaus; Cristel Pelsser (CPAIOR (1), 2024)

Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CPAIOR (1), 2024)

A Constraint Programming Approach for Aircraft Disassembly Scheduling. - Charles Thomas 005; Pierre Schaus (CPAIOR (2), 2024)

An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems. - Bastián Véjar; Gaël Aglin; Ali Irfan Mahmutogullari; Siegfried Nijssen; Pierre Schaus; Tias Guns (CPAIOR (2), 2024)

Efficient Lookahead Decision Trees. - Harold Silvère Kiossou; Pierre Schaus; Siegfried Nijssen; Gaël Aglin (IDA (2), 2024)

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection. - Vianney Coppé; Xavier Gillard; Pierre Schaus (INFORMS J. Comput., 2024)

Impact of Weather Factors on Migration Intention Using Machine Learning Algorithms. - John O. R. Aoga; Juhee Bae; Stefanija Veljanoska; Siegfried Nijssen; Pierre Schaus (Oper. Res. Forum, 2024)

Modeling and Solving a Composite Structure Design Problem with Constraint Programming (Short Paper). - Miguel Antoons; Augustin Delecluse; Samih Zein; Pierre Schaus (CP, 2025)

A Dynamic Programming Approach for the Job Sequencing and Tool Switching Problem. - Emma Legrand; Vianney Coppé; Daniele Catanzaro; Pierre Schaus (CPAIOR (2), 2025)

Implementing Cumulative Functions with Generalized Cumulative Constraints. - Pierre Schaus; Charles Thomas 005; Roger Kameugne (CoRR, 2025)

A Generic Complete Anytime Beam Search for Optimal Decision Tree. - Harold Silvère Kiossou; Siegfried Nijssen; Pierre Schaus (CoRR, 2025)