| 2019 | A Computational Comparison of Optimization Methods for the Golomb Ruler Problem. | Burak Kocuk, Willem-Jan van Hoeve |
| 2019 | Modelling and Solving the Minimum Shift Design Problem. | Lucas Kletzander, Nysret Musliu |
| 2019 | A Hybrid Approach for Exact Coloring of Massive Graphs. | Emmanuel Hebrard, George Katsirelos |
| 2019 | Repairing Learned Controllers with Convex Optimization: A Case Study. | Dario Guidotti, Francesco Leofante, Claudio Castellini, Armando Tacchella |
| 2019 | Optimality Clue for Graph Coloring Problem. | Alexandre Gondran, Laurent Moalic |
| 2019 | An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem. | Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan |
| 2019 | Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. | Tobias Geibinger, Florian Mischek, Nysret Musliu |
| 2019 | An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. | Cristian Frasinaru, Madalina Raschip |
| 2019 | Learning MILP Resolution Outcomes Before Reaching Time-Limit. | Martina Fischetti, Andrea Lodi, Giulia Zarpellon |
| 2019 | The Maximum Weighted Submatrix Coverage Problem: A CP Approach. | Guillaume Derval, Vincent Branders, Pierre Dupont, Pierre Schaus |
| 2019 | An Investigation into Prediction + Optimisation for the Knapsack Problem. | Emir Demirovic, Peter J. Stuckey, James Bailey, Jeffrey Chan, Chris Leckie, Kotagiri Ramamohanarao, Tias Guns |
| 2019 | Consistency for 0-1 Programming. | Danial Davarnia, John N. Hooker |
| 2019 | An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service. | Gnther Cwioro, Philipp Hungerlnder, Kerstin Maier, Jrg Pcher, Christian Truden |
| 2019 | A Counting-Based Approach to Scalable Micro-service Deployment. | Waldemar Cruz, Fanghui Liu, Laurent Michel |
| 2019 | Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. | Pierre Coste, Andrea Lodi, Gilles Pesant |
| 2019 | Evaluating Ising Processing Units with Integer Programming. | Carleton Coffrin, Harsha Nagarajan, Russell Bent |
| 2019 | A Sampling-Free Anticipatory Algorithm for the Kidney Exchange Problem. | Danuta Sorina Chisca, Michele Lombardi, Michela Milano, Barry O'Sullivan |
| 2019 | A Constraint Programming Approach to Electric Vehicle Routing with Time Windows. | Kyle E. C. Booth, J. Christopher Beck |
| 2019 | Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams. | Pim van den Bogaerdt, Mathijs de Weerdt |
| 2019 | SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. | Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret |
| 2019 | Generating Compound Moves in Local Search by Hybridisation with Complete Search. | Gustav Bjrdal, Pierre Flener, Justin Pearson |
| 2019 | Local Rapid Learning for Integer Programs. | Timo Berthold, Peter J. Stuckey, Jakob Witzig |
| 2019 | Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation. | David Bergman, Carlos Cardonha, Saharnaz Mehrani |
| 2019 | Core-Boosted Linear Search for Incomplete MaxSAT. | Jeremias Berg, Emir Demirovic, Peter J. Stuckey |
| 2019 | Computing Wasserstein Barycenters via Linear Programming. | Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni |