| 2022 | A Learning Large Neighborhood Search for the Staff Rerostering Problem. | Fabio Francisco Oberweger, Gnther R. Raidl, Elina Rnnberg, Marc Huber |
| 2022 | Multiple-choice Knapsack Constraint in Graphical Models. | Pierre Montalbano, Simon de Givry, George Katsirelos |
| 2022 | Training Thinner and Deeper Neural Networks: Jumpstart Regularization. | Carles Roger Riera Molina, Camilo Rey, Thiago Serra, Eloi Puertas, Oriol Pujol |
| 2022 | Dealing with the Product Constraint. | Steve Malalel, Victor Jung, Jean-Charles Rgin, Marie Pelleau |
| 2022 | Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem. | Yiqing L. Luo, J. Christopher Beck |
| 2022 | A FastMap-Based Algorithm for Block Modeling. | Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2022 | Learning a Propagation Complete Formula. | Petr Kucera |
| 2022 | Deep Policy Dynamic Programming for Vehicle Routing Problems. | Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho, Max Welling |
| 2022 | Efficient Operations Between MDDs and Constraints. | Victor Jung, Jean-Charles Rgin |
| 2022 | Improving the Robustness of EPS to Solve the TSP. | Nicolas Isoart, Jean-Charles Rgin |
| 2022 | Stochastic Decision Diagrams. | John N. Hooker |
| 2022 | Solving the Extended Job Shop Scheduling Problem with AGVs - Classical and Quantum Approaches. | Marc Geitz, Cristian Grozea, Wolfgang Steigerwald, Robin Sthr, Armin Wolf |
| 2022 | Learning Pseudo-Backdoors for Mixed Integer Programs. | Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue |
| 2022 | Shattering Inequalities for Learning Optimal Decision Trees. | Justin J. Boutilier, Carla Michini, Zachary Zhou |
| 2022 | Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions. | Ignace Bleukx, Senne Berden, Lize Coenen, Nicholas Decleyre, Tias Guns |
| 2022 | Coupling Different Integer Encodings for SAT. | Hendrik Bierlee, Graeme Gange, Guido Tack, Jip J. Dekker, Peter J. Stuckey |
| 2022 | Towards Copeland Optimization in Combinatorial Problems. | Sidhant Bhavnani, Alexander Schiendorfer |
| 2022 | Transferring Information Across Restarts in MIP. | Timo Berthold, Gregor Hendel, Domenico Salvagnin |
| 2022 | A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons. | Gennaro Auricchio, Luca Ferrarini, Stefano Gualandi, Greta Lanzarotto, Ludovico Pernazza |
| 2022 | A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times. | Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis |
| 2022 | Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists. | Ulrich Avodji, Julien Ferry, Sbastien Gambs, Marie-Jos Huguet, Mohamed Siala |
| 2021 | A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. | Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha |
| 2021 | A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming. | Marvin Stanczak, Cdric Pralet, Vincent Vidal, Vincent Baudoui |
| 2021 | Injecting Domain Knowledge in Neural Networks: A Controlled Experiment on a Constrained Problem. | Mattia Silvestri, Michele Lombardi, Michela Milano |
| 2021 | Learning to Reduce State-Expanded Networks for Multi-activity Shift Scheduling. | Till Porrmann, Michael Rmer |