Local search and constraint programming for a real-world examination timetabling problem
Michele Battistutta, Sara Ceschia, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf and Elena Topan
Optimizing Student Course Preferences in School Timetabling
Richard Hoshino and Irene Fabris
An Ising Framework for Constrained Clustering on Special Purpose Hardware
Eldan Cohen, Arik Senderovich and J. Christopher Beck
Core-Guided and Core-Boosted Search for CP
Graeme Gange, Jeremias Berg, Emir Demirović and Peter J. Stuckey
Primal Heuristics for Wasserstein Barycenters
Stefano Gualandi, Louis-Martin Rousseau and Pierre-Yves Bouchet
Conflict-Free Learning for Mixed Integer Programming
Jakob Witzig and Timo Berthold
Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
Ondřej Benedikt, István Módos and Zdeněk Hanzálek
CP and Hybrid Models for Two-Stage Batching and Scheduling
Tanya Tang and J. Christopher Beck
A New Constraint Programming Model and Solving for the Cyclic Hoist Scheduling Problem
Mark Wallace and Neil Yorke-Smith
Enumerative Branching with Less Repetition
Thiago Serra
Lossless Compression of Deep Neural Networks
Thiago Serra, Abhinav Kumar and Srikumar Ramalingam
Relaxation-Aware Heuristics for Exact Optimization in Graphical Models
Fulya Trösser, Simon de Givry and George Katsirelos
Adaptive CP-based Lagrangian Relaxation for TSP Solving
Nicolas Isoart and Jean-Charles Régin
Robust Resource Planning for Aircraft Ground Operations
Yagmur Gok, Daniel Guimarans, Peter Stuckey, Maurizio Tomasella and Cemalettin Ozturk
Exact method approaches for the differential harvest problem
Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau and Olivier Naud
From MiniZinc to Optimization Modulo Theories, and Back
Francesco Contaldo, Patrick Trentin and Roberto Sebastiani
Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
Maximilian Thiessen, Luis Quesada and Kenneth N. Brown
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm (*CA)
Marc Etheve, Zacharie Ales, Côme Bissuel, Olivier Juan and Safia Kedad-Sidhoum
Minimum Cycle Partition with Length Requirements
Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Thorsten Koch and Carl Johan Casselgren
Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
Charles Thomas, Roger Kameugne and Pierre Schaus
Bilevel Optimization for On-Demand Multimodal Transit Systems
Beste Basciftci and Pascal Van Hentenryck
Hybrid Classification and Reasoning for Image-based Constraint Solving
Maxime Mulamba, Jayanta Mandi, Rocsildes Canoy and Tias Guns
Learn to Relax: Integrating 0-1 Integer Linear Programming with pseudo-Boolean Conflict-Driven Search
Jo Devriendt, Ambros Gleixner and Jakob Nordström
Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Özgür Akgün, Nguyen Dang, Ian Miguel, Andras Z. Salamon, Patrick Spracklen and Christopher Stone
Template Matching and Decision Diagrams for Multi-Agent Path Finding
Jayanth Krishna Mogali, Willem-Jan Van Hoeve and Stephen Smith
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem (*CA)
Katalin Fazekas, Markus Sinnl, Armin Biere and Sophie Parragh
Parameterised Bounds on the Sum of Variables in Time-Series Constraints
Nicolas Beldiceanu, Maria-Isabel Restrepo-Ruiz and Helmut Simonis
Integer programming techniques for minor-embedding in quantum annealers
David Bernal, Kyle Booth, Raouf Dridi, Hedayat Alghassi, Sridhar Tayur and Davide Venturelli
Multi-speed Gearbox Synthesis using Global Search and Non-Convex Optimization
Chiara Piacentini, Hyunmin Cheong, Mehran Ebrahimi and Adrian Butscher
Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
Kevin Dalmeijer and Pascal Van Hentenryck
Leveraging Constraint Scheduling: A Case Study to the Textile Industry
Alexandre Mercier-Aubin, Gaudreault Jonathan and Claude-Guy Quimper
Minimal Perturbation in University Timetabling with Maximum Satisfiability
Alexandre Lemos, Pedro T. Monteiro and Inês Lynce
An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem
Mohammed Najib Haouas, Daniel Aloise and Gilles Pesant
A learning based algorithm to quickly obtain good primal solution for Stochastic Integer Programs
Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel and Sriram Sankaranarayanan
The Potential of Quantum Annealing for Rapid Solution Structure Identification
Yuchen Pang, Carleton Coffrin, Andrey Lokhov and Marc Vuffray
Scheduling of Dual-Arm Multi-Tool Assembly Robots and Workspace Layout Optimization
Johan Ludde Wessén, Christian Schulte and Mats Carlsson