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