LIPIcs, Volume 210, CP 2021

• Laurent D. Michel LIPIcs, Volume 210, CP 2021, Complete Volume 10.4230/LIPIcs.CP.2021
• Laurent D. Michel Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CP.2021.0
• Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, and M.Grazia Speranza The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk) 10.4230/LIPIcs.CP.2021.1
• Ferdinando Fioretto Constrained-Based Differential Privacy (Invited Talk) 10.4230/LIPIcs.CP.2021.2
• Defeng Liu and Andrea Lodi Learning in Local Branching (Invited Talk) 10.4230/LIPIcs.CP.2021.3
• João Araújo, Choiwah Chow, and Mikoláš Janota Filtering Isomorphic Models by Invariants (Short Paper) 10.4230/LIPIcs.CP.2021.4
• Shaowei Cai, Chuan Luo, Xindi Zhang, and Jian Zhang Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper) 10.4230/LIPIcs.CP.2021.5
• Markus Iser and Tomáš Balyo Unit Propagation with Stable Watches (Short Paper) 10.4230/LIPIcs.CP.2021.6
• Anissa Kheireddine, Etienne Renault, and Souheib Baarir Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper) 10.4230/LIPIcs.CP.2021.7
• Tuukka Korhonen and Matti Järvisalo Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper) 10.4230/LIPIcs.CP.2021.8
• Hongbo Li, Minghao Yin, and Zhanshan Li Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper) 10.4230/LIPIcs.CP.2021.9
• Guilherme de Azevedo Silveira Generating Magical Performances with Constraint Programming (Short Paper) 10.4230/LIPIcs.CP.2021.10
• Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles 10.4230/LIPIcs.CP.2021.11
• Carlos Ansótegui, Jesús Ojeda, and Eduard Torres Building High Strength Mixed Covering Arrays with Constraints 10.4230/LIPIcs.CP.2021.12
• Valentin Antuori, Tom Portoleau, Louis Rivière, and Emmanuel Hebrard On How Turing and Singleton Arc Consistency Broke the Enigma Code 10.4230/LIPIcs.CP.2021.13
• Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, and Alain Nguyen Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem 10.4230/LIPIcs.CP.2021.14
• Blair Archibald, Kyle Burns, Ciaran McCreesh, and Michele Sevegnani Practical Bigraphs via Subgraph Isomorphism 10.4230/LIPIcs.CP.2021.15
• Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, and Helmut Simonis The Hybrid Flexible Flowshop with Transportation Times 10.4230/LIPIcs.CP.2021.16
• Yiwei Bai, Di Chen, and Carla P. Gomes CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games 10.4230/LIPIcs.CP.2021.17
• Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec An Interval Constraint Programming Approach for Quasi Capture Tube Validation 10.4230/LIPIcs.CP.2021.18
• Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, and Adrien Varet Exhaustive Generation of Benzenoid Structures Sharing Common Patterns 10.4230/LIPIcs.CP.2021.19
• Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux Combining VSIDS and CHB Using Restarts in SAT 10.4230/LIPIcs.CP.2021.20
• Martin C. Cooper and João Marques-Silva On the Tractability of Explaining Decisions of Classifiers 10.4230/LIPIcs.CP.2021.21
• Ágnes Cseh, Guillaume Escamocher, Begüm Genç, and Luis Quesada A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences 10.4230/LIPIcs.CP.2021.22
• Tomáš Dlask, Tomáš Werner, and Simon de Givry Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations 10.4230/LIPIcs.CP.2021.23
• Johannes K. Fichte, Markus Hecher, and Valentin Roland Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization 10.4230/LIPIcs.CP.2021.24
• Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, and Anas Shahab Complications for Computational Experiments from Modern Processors 10.4230/LIPIcs.CP.2021.25
• Cristian Galleguillos, Zeynep Kiziltan, and Ricardo Soto A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications 10.4230/LIPIcs.CP.2021.26
• Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, and Laurent Simon The Dungeon Variations Problem Using Constraint Programming 10.4230/LIPIcs.CP.2021.27
• Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo Refined Core Relaxation for Core-Guided MaxSAT Solving 10.4230/LIPIcs.CP.2021.28
• Nicolas Isoart and Jean-Charles Régin A Linear Time Algorithm for the k-Cutset Constraint 10.4230/LIPIcs.CP.2021.29
• Nicolas Isoart and Jean-Charles Régin A k-Opt Based Constraint for the TSP 10.4230/LIPIcs.CP.2021.30
• Mikoláš Janota, António Morgado, José Fragoso Santos, and Vasco Manquinho The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets 10.4230/LIPIcs.CP.2021.31
• Peter Jonsson, Victor Lagerkvist, and Sebastian Ordyniak Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors 10.4230/LIPIcs.CP.2021.32
• Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent Learning TSP Requires Rethinking Generalization 10.4230/LIPIcs.CP.2021.33
• Markus Kirchweger and Stefan Szeider SAT Modulo Symmetries for Graph Generation 10.4230/LIPIcs.CP.2021.34
• Anton Korikov and J. Christopher Beck Counterfactual Explanations via Inverse Constraint Programming 10.4230/LIPIcs.CP.2021.35
• Benjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, and Martin Gebser Utilizing Constraint Optimization for Industrial Machine Workload Balancing 10.4230/LIPIcs.CP.2021.36
• Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, and Felix Winter Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem 10.4230/LIPIcs.CP.2021.37
• Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, and Kun He Combining Clause Learning and Branch and Bound for MaxSAT 10.4230/LIPIcs.CP.2021.38
• Bohan Li, Kai Wang, Yiyuan Wang, and Shaowei Cai Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search 10.4230/LIPIcs.CP.2021.39
• Luc Libralesso, François Delobel, Pascal Lafourcade, and Christine Solnon Automatic Generation of Declarative Models For Differential Cryptanalysis 10.4230/LIPIcs.CP.2021.40
• Xiangshuang Liu, Ziyu Chen, Dingding Chen, and Junsong Gao A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems 10.4230/LIPIcs.CP.2021.41
• Jayanta Mandi, Rocsildes Canoy, Víctor Bucarey, and Tias Guns Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP 10.4230/LIPIcs.CP.2021.42
• Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, and Holger H. Hoos Statistical Comparison of Algorithm Performance Through Instance Selection 10.4230/LIPIcs.CP.2021.43
• Andreas Niskanen, Jeremias Berg, and Matti Järvisalo Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights 10.4230/LIPIcs.CP.2021.44
• Xiao Peng, Christine Solnon, and Olivier Simonin Solving the Non-Crossing MAPF with CP 10.4230/LIPIcs.CP.2021.45
• Luis Quesada and Kenneth N. Brown Positive and Negative Length-Bound Reachability Constraints 10.4230/LIPIcs.CP.2021.46
• Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, and Alexey Ignatiev Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms 10.4230/LIPIcs.CP.2021.47
• Ilankaikone Senthooran, Pierre Le Bodic, and Peter J. Stuckey Optimising Training for Service Delivery 10.4230/LIPIcs.CP.2021.48
• Ilankaikone Senthooran, Matthias Klapperstueck, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, and Maria Garcia de la Banda Human-Centred Feasibility Restoration 10.4230/LIPIcs.CP.2021.49
• Pouya Shati, Eldan Cohen, and Sheila McIlraith SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features 10.4230/LIPIcs.CP.2021.50
• Pavel Smirnov, Jeremias Berg, and Matti Järvisalo Pseudo-Boolean Optimization by Implicit Hitting Sets 10.4230/LIPIcs.CP.2021.51
• Boro Sofranac, Ambros Gleixner, and Sebastian Pokutta An Algorithm-Independent Measure of Progress for Linear Constraint Propagation 10.4230/LIPIcs.CP.2021.52
• Shannon Sweitzer and T. K. Satish Kumar Differential Programming via OR Methods 10.4230/LIPIcs.CP.2021.53
• Dimosthenis C. Tsouros and Kostas Stergiou Learning Max-CSPs via Active Constraint Acquisition 10.4230/LIPIcs.CP.2021.54
• Nils Merlin Ullmann, Tomáš Balyo, and Michael Klein Parallelizing a SAT-Based Product Configurator 10.4230/LIPIcs.CP.2021.55
• Mathieu Vavrille, Charlotte Truchet, and Charles Prud'homme Solution Sampling with Random Table Constraints 10.4230/LIPIcs.CP.2021.56
• Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, and Ji Wang Making Rigorous Linear Programming Practical for Program Analysis 10.4230/LIPIcs.CP.2021.57
• Jiong Yang and Kuldeep S. Meel Engineering an Efficient PB-XOR Solver 10.4230/LIPIcs.CP.2021.58
• Ghiles Ziat, Matthieu Dien, and Vincent Botbol Automated Random Testing of Numerical Constrained Types 10.4230/LIPIcs.CP.2021.59
• Roie Zivan, Omer Perry, Ben Rachmut, and William Yeoh The Effect of Asynchronous Execution and Message Latency on Max-Sum 10.4230/LIPIcs.CP.2021.60