default search action
28th CP 2022: Haifa, Israel
- Christine Solnon:
28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel. LIPIcs 235, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-240-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Donald E. Knuth:
All Questions Answered (Invited Talk). 1:1-1:1 - Kristina Asimi, Libor Barto
, Silvia Butti:
Fixed-Template Promise Model Checking Problems. 2:1-2:17 - Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Improved Sample Complexity Bounds for Branch-And-Cut. 3:1-3:19 - Libor Barto
Weisfeiler-Leman Invariant Promise Valued CSPs. 4:1-4:17 - Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar:
Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. 5:1-5:17 - Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin
Acquiring Maps of Interrelated Conjectures on Sharp Bounds. 6:1-6:18 - Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon de Givry:
Parallel Hybrid Best-First Search. 7:1-7:10 - Senne Berden, Mohit Kumar, Samuel Kolb, Tias Guns
Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation. 8:1-8:17 - Christian Bessiere, Clément Carbonnel, Martin C. Cooper
Complexity of Minimum-Size Arc-Inconsistency Explanations. 9:1-9:14 - Raphaël Boudreault
A Constraint Programming Approach to Ship Refit Project Scheduling. 10:1-10:16 - Clément Carbonnel:
On Redundancy in Constraint Satisfaction Problems. 11:1-11:15 - Mohamed Sami Cherif
From Crossing-Free Resolution to Max-SAT Resolution. 12:1-12:17 - Martin C. Cooper, Arnaud Lequen, Frédéric Maris:
Isomorphisms Between STRIPS Problems and Sub-Problems. 13:1-13:16 - Vianney Coppé, Xavier Gillard
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. 14:1-14:18 - Christopher Coulombe, Claude-Guy Quimper:
Constraint Acquisition Based on Solution Counting. 15:1-15:16 - Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. 16:1-16:19 - Timothy Curry, Gabriel De Pace, Benjamin Fuller, Laurent Michel, Yan Lindsay Sun:
DUELMIPs: Optimizing SDN Functionality and Security. 17:1-17:18 - Nguyen Dang
A Framework for Generating Informative Benchmark Instances. 18:1-18:18 - Augustin Delecluse, Pierre Schaus, Pascal Van Hentenryck:
Sequence Variables for Routing Problems. 19:1-19:17 - Jan Dreier
CSP Beyond Tractable Constraint Languages. 20:1-20:17 - Alexander Ek
Explaining Propagation for Gini and Spread with Variable Mean. 21:1-21:16 - Joan Espasa
Plotting: A Planning Problem with Complex Transitions. 22:1-22:17 - Hélène Fargier, Jérôme Mengin, Nicolas Schmidt:
Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms. 23:1-23:18 - Rebecca Gentzel
Heuristics for MDD Propagation in HADDOCK. 24:1-24:17 - Stephan Gocht, Ciaran McCreesh, Jakob Nordström
An Auditable Constraint Programming Solver. 25:1-25:18 - Marijn J. H. Heule, Anthony Karahalios, Willem-Jan van Hoeve:
From Cliques to Colorings and Back Again. 26:1-26:10 - Amel Hidouri
On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach. 27:1-27:17 - Ruth Hoffmann
Understanding How People Approach Constraint Modelling and Solving. 28:1-28:18 - Mohit Kumar, Samuel Kolb, Tias Guns
Learning Constraint Programming Models from Data Using Generate-And-Aggregate. 29:1-29:16 - Daphné Lafleur, Sarath Chandar, Gilles Pesant:
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints. 30:1-30:16 - Jimmy H. M. Lee, Allen Z. Zhong:
Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization. 31:1-31:17 - Hongbo Li
A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems. 32:1-32:10 - Jheisson López, Alejandro Arbelaez
Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains. 33:1-33:16 - Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, Quentin Cappart:
Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming. 34:1-34:15 - Isaac Rudich, Quentin Cappart, Louis-Martin Rousseau:
Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams. 35:1-35:20 - Mate Soos, Priyanka Golia, Sourav Chakraborty, Kuldeep S. Meel:
On Quantitative Testing of Samplers. 36:1-36:16 - Fulya Trösser, Simon de Givry, George Katsirelos:
Structured Set Variable Domains in Bayesian Network Structure Learning. 37:1-37:9 - Felix Ulrich-Oltean
Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints. 38:1-38:17 - Jie Wang, Dingding Chen, Ziyu Chen, Xiang-Shuang Liu, Junsong Gao:
Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs. 39:1-39:17 - Ruiwei Wang, Roland H. C. Yap:
CNF Encodings of Binary Constraint Trees. 40:1-40:19 - Felix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz:
Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry. 41:1-41:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: