Table of Contents

• Instance Generation via Generator InstancesÖzgür Akgün, Nguyen-Dang, Ian Miguel, András Z. Salamon, Christopher Stone. 3-19 [doi]
• Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean ConstraintsCarlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen-Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret. 20-36 [doi]
• Exploring Declarative Local-Search Neighbourhoods with Constraint ProgrammingGustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey. 37-53 [doi]
• Vehicle Routing by Learning from Historical SolutionsRocsildes Canoy, Tias Guns. 54-70 [doi]
• On Symbolic Approaches for Computing the Matrix PermanentSupratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi. 71-90 [doi]
• Towards the Characterization of Max-Resolution Transformations of UCSs by UP-ResilienceMohamed Sami Cherif, Djamal Habet. 91-107 [doi]
• Logic-Based Benders Decomposition for Super Solutions: An Application to the Kidney Exchange ProblemDanuta Sorina Chisca, Michele Lombardi 0001, Michela Milano, Barry O'Sullivan. 108-125 [doi]
• Exploiting Glue Clauses to Design Effective CDCL Branching HeuristicsMd. Solimul Chowdhury, Martin Müller 0003, Jia-Huai You. 126-143 [doi]
• Industrial Size Job Shop Scheduling Tackled by Present Day CP SolversGiacomo Da Col, Erich Christian Teppan. 144-160 [doi]
• Dual Hashing-Based Algorithms for Discrete IntegrationAlexis de Colnet, Kuldeep S. Meel. 161-176 [doi]
• Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided SearchEmir Demirovic, Peter J. Stuckey. 177-194 [doi]
• A Join-Based Hybrid Parameter for Constraint SatisfactionRobert Ganian, Sebastian Ordyniak, Stefan Szeider. 195-212 [doi]
• An Incremental SAT-Based Approach to the Graph Colouring ProblemGael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski. 213-231 [doi]
• Constraint-Based Techniques in Stochastic Local Search MaxSAT SolvingAndreia P. Guerreiro, Miguel Terra-Neves, Inês Lynce, José Rui Figueira, Vasco M. Manquinho. 232-250 [doi]
• Trimming Graphs Using Clausal Proof OptimizationMarijn J. H. Heule. 251-267 [doi]
• Improved Job Sequencing Bounds from Decision DiagramsJohn N. Hooker. 268-283 [doi]
• Integration of Structural Constraints into TSP ModelsNicolas Isoart, Jean-Charles Régin. 284-299 [doi]
• Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local SearchArtem Kaznatcheev, David A. Cohen, Peter G. Jeavons. 300-316 [doi]
• Estimating the Number of Solutions of Cardinality Constraints Through \texttt range and \texttt roots DecompositionsGiovanni Lo Bianco, Xavier Lorca, Charlotte Truchet. 317-332 [doi]
• Understanding the Empirical Hardness of Random Optimisation ProblemsCiaran McCreesh, William Pettersson, Patrick Prosser. 333-349 [doi]
• Guarded Constraint Models Define Treewidth Preserving ReductionsDavid Mitchell. 350-365 [doi]
• Automatic Streamlining for Constrained OptimisationPatrick Spracklen, Nguyen-Dang, Özgür Akgün, Ian Miguel. 366-383 [doi]
• Compiling Conditional ConstraintsPeter J. Stuckey, Guido Tack. 384-400 [doi]
• Training Binarized Neural Networks Using MIP and CPRodrigo Toro Icarte, León Illanes, Margarita P. Castro, André A. Ciré, Sheila A. McIlraith, J. Christopher Beck. 401-417 [doi]
• Models for Radiation Therapy Patient SchedulingSara Frimodig, Christian Schulte. 421-437 [doi]
• Constraint Programming-Based Job Dispatching for Modern HPC ApplicationsCristian Galleguillos, Zeynep Kiziltan, Alina Sîrbu, Özalp Babaoglu. 438-455 [doi]
• Scheduling of Mobile Robots Using Constraint ProgrammingStanislav Murín, Hana Rudová. 456-471 [doi]
• Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment ProblemsAdriana Pacheco, Cédric Pralet, Stéphanie Roussel 0001. 472-487 [doi]
• An Improved GPU-Based SAT Model CounterJohannes Klaus Fichte, Markus Hecher, Markus Zisser. 491-509 [doi]
• Reducing Bias in Preference Aggregation for Multiagent Soft Constraint ProblemsAlexander Schiendorfer, Wolfgang Reif. 510-526 [doi]
• A Cube Distribution Approach to QBF Solving and Certificate MinimizationLi Cheng Chen, Jie-Hong R. Jiang. 529-546 [doi]
• Functional Synthesis with ExamplesGrigory Fedyukovich, Aarti Gupta. 547-564 [doi]
• SolverCheck: Declarative Testing of ConstraintsXavier Gillard, Pierre Schaus, Yves Deville. 565-582 [doi]
• Encodings for Enumeration-Based Program SynthesisPedro Orvalho, Miguel Terra-Neves, Miguel Ventura, Ruben Martins, Vasco M. Manquinho. 583-599 [doi]
• Lemma Synthesis for Automating Induction over Algebraic Data TypesWeikun Yang, Grigory Fedyukovich, Aarti Gupta. 600-617 [doi]
• Modeling Pattern Set Mining Using Boolean CircuitsJohn O. R. Aoga, Siegfried Nijssen, Pierre Schaus. 621-638 [doi]
• Differential Privacy of Hierarchical Census Data: An Optimization ApproachFerdinando Fioretto, Pascal Van Hentenryck. 639-655 [doi]
• Generic Constraint-Based Block Modeling Using Constraint ProgrammingAlex Mattenet, Ian Davidson, Siegfried Nijssen, Pierre Schaus. 656-673 [doi]
• Reward Potentials for Planning with Learned Neural Network Transition ModelsBuser Say, Scott Sanner, Sylvie Thiébaux. 674-689 [doi]
• Exploiting Counterfactuals for Scalable Stochastic OptimizationStefan Kuhlemann, Meinolf Sellmann, Kevin Tierney. 690-708 [doi]
• Structure-Driven Multiple Constraint AcquisitionDimosthenis C. Tsouros, Kostas Stergiou 0001, Christian Bessiere. 709-725 [doi]
• Towards Robust Scenarios of Spatio-Temporal Renewable Energy Planning: A GIS-RO ApproachNadeem Al-Kurdi, Benjamin Pillot, Carmen Gervet, Laurent Linguet. 729-747 [doi]
• Peak-Hour Rail Demand Shifting with Discrete OptimisationJohn M. Betts, David L. Dowe, Daniel Guimarans, Daniel Damir Harabor, Heshan Kumarage, Peter J. Stuckey, Michael Wybrow. 748-763 [doi]
• Functional Significance Checking in Noisy Gene Regulatory NetworksS. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman. 767-785 [doi]