Table of Contents

• Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper)Hongbo Li, Minghao Yin, Zhanshan Li. [doi]
• An Algorithm-Independent Measure of Progress for Linear Constraint PropagationBoro Sofranac, Ambros M. Gleixner, Sebastian Pokutta. [doi]
• Practical Bigraphs via Subgraph IsomorphismBlair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani. [doi]
• Parallelizing a SAT-Based Product ConfiguratorNils Merlin Ullmann, Tomás Balyo, Michael Klein. [doi]
• SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary FeaturesPouya Shati, Eldan Cohen, Sheila A. McIlraith. [doi]
• A Linear Time Algorithm for the k-Cutset ConstraintNicolas Isoart, Jean-Charles Régin. [doi]
• Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)Anissa Kheireddine, Etienne Renault, Souheib Baarir. [doi]
• Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing WeightsAndreas Niskanen, Jeremias Berg, Matti Järvisalo. [doi]
• Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRPJayanta Mandi, Rocsildes Canoy, Víctor Bucarey, Tias Guns. [doi]
• A k-Opt Based Constraint for the TSPNicolas Isoart, Jean-Charles Régin. [doi]
• Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)Shaowei Cai, Chuan Luo, Xindi Zhang, Jian Zhang. [doi]
• The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk)Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza. [doi]
• Making Rigorous Linear Programming Practical for Program AnalysisTengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, Ji Wang. [doi]
• Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling ProblemValentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, Alain Nguyen. [doi]
• SAT Modulo Symmetries for Graph GenerationMarkus Kirchweger, Stefan Szeider. [doi]
• Optimising Training for Service DeliveryIlankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey. [doi]
• Automatic Generation of Declarative Models For Differential CryptanalysisLuc Libralesso, François Delobel, Pascal Lafourcade 0001, Christine Solnon. [doi]
• Learning TSP Requires Rethinking GeneralizationChaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent 0001. [doi]
• A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern ApplicationsCristian Galleguillos, Zeynep Kiziltan, Ricardo Soto 0001. [doi]
• Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric VehiclesSaman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby. [doi]
• Combining VSIDS and CHB Using Restarts in SATMohamed Sami Cherif, Djamal Habet, Cyril Terrioux. [doi]
• Combining Clause Learning and Branch and Bound for MaxSATChu Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He. [doi]
• Human-Centred Feasibility RestorationIlankaikone Senthooran, Matthias Klapperstück, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace 0001, Michael Wybrow, Maria Garcia de la Banda. [doi]
• Solution Sampling with Random Table ConstraintsMathieu Vavrille, Charlotte Truchet, Charles Prud'homme. [doi]
• Positive and Negative Length-Bound Reachability ConstraintsLuis Quesada 0001, Kenneth N. Brown. [doi]
• The Seesaw Algorithm: Function Optimization Using Implicit Hitting SetsMikolás Janota, António Morgado, José Fragoso Santos, Vasco M. Manquinho. [doi]
• Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local SearchBohan Li, Kai Wang, Yiyuan Wang, Shaowei Cai. [doi]
• Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for BackdoorsPeter Jonsson, Victor Lagerkvist, Sebastian Ordyniak. [doi]
• Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling ProblemMarie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter. [doi]
• Counterfactual Explanations via Inverse Constraint ProgrammingAnton Korikov, J. Christopher Beck. [doi]
• Generating Magical Performances with Constraint Programming (Short Paper)Guilherme de Azevedo Silveira. [doi]
• Utilizing Constraint Optimization for Industrial Machine Workload BalancingBenjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, Martin Gebser. [doi]
• Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware UtilizationJohannes Klaus Fichte, Markus Hecher, Valentin Roland. [doi]
• An Interval Constraint Programming Approach for Quasi Capture Tube ValidationAbderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stéphane Le Ménec. [doi]
• Solving the Non-Crossing MAPF with CPXiao Peng, Christine Solnon, Olivier Simonin 0001. [doi]
• CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial GamesYiwei Bai, Di Chen 0001, Carla P. Gomes. [doi]
• Automated Random Testing of Numerical Constrained TypesGhiles Ziat, Matthieu Dien, Vincent Botbol. [doi]
• Learning in Local Branching (Invited Talk)Defeng Liu, Andrea Lodi 0001. [doi]
• The Hybrid Flexible Flowshop with Transportation TimesEddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis. [doi]
• The Effect of Asynchronous Execution and Message Latency on Max-SumRoie Zivan, Omer Perry, Ben Rachmut, William Yeoh 0001. [doi]
• Pseudo-Boolean Optimization by Implicit Hitting SetsPavel Smirnov, Jeremias Berg, Matti Järvisalo. [doi]
• Complications for Computational Experiments from Modern ProcessorsJohannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab. [doi]
• Constrained-Based Differential Privacy (Invited Talk)Ferdinando Fioretto. [doi]
• The Dungeon Variations Problem Using Constraint ProgrammingGaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon. [doi]
• Unit Propagation with Stable Watches (Short Paper)Markus Iser, Tomás Balyo. [doi]
• Engineering an Efficient PB-XOR SolverJiong Yang, Kuldeep S. Meel. [doi]
• Bounds on Weighted CSPs Using Constraint Propagation and Super-ReparametrizationsTomás Dlask, Tomás Werner, Simon de Givry. [doi]
• A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization ProblemsXiang-Shuang Liu, Ziyu Chen, Dingding Chen, Junsong Gao. [doi]
• Statistical Comparison of Algorithm Performance Through Instance SelectionThéo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger H. Hoos. [doi]
• Building High Strength Mixed Covering Arrays with ConstraintsCarlos Ansótegui, Jesus Ojeda, Eduard Torres. [doi]
• Filtering Isomorphic Models by Invariants (Short Paper)João Araújo 0002, Choiwah Chow, Mikolás Janota. [doi]
• Refined Core Relaxation for Core-Guided MaxSAT SolvingHannes Ihalainen, Jeremias Berg, Matti Järvisalo. [doi]
• Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)Tuukka Korhonen, Matti Järvisalo. [doi]
• Differential Programming via OR MethodsShannon Sweitzer, T. K. Satish Kumar. [doi]
• On How Turing and Singleton Arc Consistency Broke the Enigma CodeValentin Antuori, Tom Portoleau, Louis Rivière, Emmanuel Hebrard. [doi]
• On the Tractability of Explaining Decisions of ClassifiersMartin C. Cooper, João Marques-Silva 0001. [doi]
• Exhaustive Generation of Benzenoid Structures Sharing Common PatternsYannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet. [doi]
• Learning Max-CSPs via Active Constraint AcquisitionDimosthenis C. Tsouros, Kostas Stergiou 0001. [doi]
• A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic PreferencesÁgnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada 0001. [doi]
• Evaluating the Hardness of SAT Instances Using Evolutionary Optimization AlgorithmsAlexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev. [doi]