Accepted Papers

Regular Technical Papers

Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar: A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs

Matteo Fischetti and Jason Jo: Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study

Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon and James Trimble: Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms

Philippe Laborie: Objective Landscapes for Constraint Programming

Philippe Laborie: An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling

Christian Hamelain, Kaourintin Le Guiban, Arpad Rimmel and Joanna Tomasik: Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design

Renaud De Landtsheer, Yoann Guyot, Gustavo Ospina, Fabian Germeau and Christophe Ponsard: Reasoning on Sequences in Constraint-Based Local Search Frameworks

Matteo Fischetti and Domenico Salvagnin: Chasing First Queens by Integer Programming

Giulia Zarpellon, Andrea Lodi and Pierre Bonami: Learning a Classification of Mixed-Integer Quadratic Programming Problems

Ferdinando Fioretto and Pascal Van Hentenryck: Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately

Edward He, Natashia Boland, George Nemhauser and Martin Savelsbergh: A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem

Robinson Duque, Alejandro Arbelaez and Juan Francisco Diaz: Online Over Time Processing of Combinatorial Problems

Vourchteang Sea, Ayumi Sugiyama and Toshiharu Sugawara: Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload

Domenico Salvagnin: Symmetry Breaking Inequalities from the Schreier-Sims table

Ondřej Benedikt, Přemysl Šůcha, István Módos, Marek Vlk and Zdeněk Hanzálek: Energy-Aware Production Scheduling with Power-Saving Modes

Angelo Oddi and Riccardo Rasconi: Greedy Randomized Search for Scalable Compilation of Quantum Circuits

Guillaume Escamocher and Barry O'Sullivan: Three-Dimensional Matching Instances are Rich in Stable Matchings

Guillaume Escamocher, Mohamed Siala and Barry O'Sullivan: From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP

Quentin Cappart, John Aoga and Pierre Schaus: EpisodeSupport: a Global Constraint for Mining Frequent Patterns in a Long Sequence of Events

Damla Kizilay, Deniz Türsel Eliiyi and Pascal Van Hentenryck: Constraint and Mathematical Programming for Integrated Port Container Terminal Operations

Anders Nicolai Knudsen, Marco Chiarandini and Kim S. Larsen: Heuristic Variants for A* Search in 3D Flight Planning

Ahmad Baubaid, Natashia Boland and Martin Savelsbergh: Dealing with Demand Uncertainty in Service Network and Load Plan Design

Philippe Olivier, Andrea Lodi and Gilles Pesant: A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems

Guilherme Alex Derenievicz and Fabiano Silva: Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems

Michael Morin, Margarita P. Castro, Kyle E. C. Booth, Tony T. Tran, Chang Liu and J. Christopher Beck: Intruder Alert! Optimization Models for Solving the Mobile Robot Graph-Clear Problem

Chang Liu, Dionne M. Aleman and J. Christopher Beck: Modelling and Solving the Senior Transportation Problem

Roberto Amadini, Graeme Gange and Peter J. Stuckey: Propagating lex, find and replace with dashed strings

Nysret Musliu, Andreas Schutt and Peter J. Stuckey: Solver Independent Rotating Workforce Scheduling

Hajar Ait Addi, Christian Bessiere, Redouane Ezzahir and Nadjib Lazaar: Time-bounded Query Generator for Constraint Acquisition

Allegra De Filippo, Michele Lombardi and Michela Milano: Off-line and on-line optimization under uncertainty: a case study on energy management

Emir Demirović and Peter Stuckey: Guiding Constraint Programming with Hot Starts for High School Timetabling

Charles Thomas and Pierre Schaus: Revisiting the Self-Adaptive Large Neighbourhood Search

Zhijiang Ye, Buser Say and Scott Sanner: Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization

Minh Thanh Khong, Christophe Lecoutre, Pierre Schaus and Yves Deville: Soft-regular with a prefix-size violation measure

Andrea Galassi, Michele Lombardi, Paola Mello and Michela Milano: Model agnostic solution of CSPs via Deep Learning: a preliminary study

Sergei Sidorov, Sergei Mironov, Alexey Faizliev and Alexandre Gudkov: Algorithms for Sparse k-Monotone Regression

Yanick Ouellet and Claude-Guy Quimper: A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning

Kim Rioux-Paradis and Claude-Guy Quimper: The WeightedCircuits LMax Constraint

Michael Römer, Andre A. Cire and Louis-Martin Rousseau: A Local Search Framework for Compiling Relaxed Decision Diagrams

Samuel Gagnon and Gilles Pesant: Accelerating Counting-Based Search

Roger Kameugne, Sévérine Betmbe Fetgo, Vincent Gingras, Yanick Ouellet and Claude-Guy Quimper: Horizontally Elastic Not-First/Not-Last Filtering Algorithm For Cumulative Resource Constraint

Max Åstrand, Mikael Johansson and Alessandro Zanarini: Fleet Scheduling in Underground Mines using Constraint Programming

Junwen Bai, Sebastian Ament, Guillaume Perez, John Gregoire and Carla Gomes: An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science

Jonathan Gomes-Selman, Qinru Shi, Yexiang Xue, Roosevelt Garcia-Villacorta, Alexander Flecker and Carla Gomes: Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks

Ole Kröger, Carleton Coffrin, Hassan Hijazi and Harsha Nagarajan: Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia

Mohammad Javad Azizi, Phebe Vayanos, Bryan Wilder, Eric Rice and Milind Tambe: Designing Fair, Efficient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources

Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak and Louis-Martin Rousseau: Learning Heuristics for the TSP by Policy Gradient

Extended Abstracts

Günther Raidl, Elina Rönnberg, Matthias Horn and Johannes Maschler: An A*-Based Algorithm to Derive Relaxed Decision Diagrams for a Prize-Collecting Sequencing Problem

Shiang-Tai Liu: Objective bounds of quadratic programming with interval coefficients and equality constraints

Mark Wallace and Aldeida Aleti: Using CP to Prove Local Search is Effective

Varun Khandelwal: Solving real world optimization problems using Artificial Intelligence

Magnus Björk, Pawel Pietrzak and Andriy Svynaryov: Modelling Real-World Strict Seniority Bidding Problems in Airline Crew Rostering

Andreas Ernst, Dhananjay Thiruvady, Davaatseren Baatar, Angus Kenny, Mohan Krishnamoorthy and Gaurav Singh: Mining, Matheuristics and Merge-Search

Alexandre Gondran and Laurent Moalic: Finding the chromatic number by counting k-colorings with a randomized heuristic

Elias Khalil and Bistra Dilkina: Training Binary Neural Networks with Combinatorial Algorithms

Emir Demirović, Nicolas Schwind, Tenda Okimoto and Katsumi Inoue: Recoverable Team Formation: Building Teams Resilient to Change