CP A

61 papers

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