| 2013 | Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint. | Andreas Schutt, Thibaut Feydy, Peter J. Stuckey |
| 2013 | On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables. | Hermann Schichl, Arnold Neumaier, Mihly Csaba Markt, Ferenc Domes |
| 2013 | Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods. | Domenico Salvagnin |
| 2013 | Constraint-Based Fitness Function for Search-Based Software Testing. | Abdelilah Sakti, Yann-Gal Guhneuc, Gilles Pesant |
| 2013 | Improved Discrete Reformulations for the Quadratic Assignment Problem. | Axel Nyberg, Tapio Westerlund, Andreas Lundell |
| 2013 | An Adaptive Model Restarts Heuristic. | Nina Narodytska, Toby Walsh |
| 2013 | Tight LP-Relaxations of Overlapping Global Cardinality Constraints. | Ioannis Mourtos |
| 2013 | Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux, Bruno Zanuttini |
| 2013 | Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem. | Yuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis |
| 2013 | Enumerating Infeasibility: Finding Multiple MUSes Quickly. | Mark H. Liffiton, Ammar Malik |
| 2013 | A Synchronized Sweep Algorithm for the | Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu |
| 2013 | An MDD Approach to Multidimensional Bin Packing. | Brian Kell, Willem Jan van Hoeve |
| 2013 | CP Methods for Scheduling and Routing with Time-Dependent Task Costs. | Elena Kelareva, Kevin Tierney, Philip Kilby |
| 2013 | Decision Diagrams and Dynamic Programming. | John N. Hooker |
| 2013 | Revisiting Hyper Binary Resolution. | Marijn Heule, Matti Jrvisalo, Armin Biere |
| 2013 | Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling. | Stefan Heinz, Wen-Yang Ku, J. Christopher Beck |
| 2013 | A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects. | Hanyu Gu, Andreas Schutt, Peter J. Stuckey |
| 2013 | Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming. | Ambros M. Gleixner, Stefan Weltge |
| 2013 | Improving Strong Branching by Propagation. | Gerald Gamrath |
| 2013 | A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. | Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim |
| 2013 | Modeling Robustness in CSPs as Weighted CSPs. | Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber |
| 2013 | Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling. | Andr A. Cir, Elvin Coban, John N. Hooker |
| 2013 | Cloud Branching. | Timo Berthold, Domenico Salvagnin |
| 2013 | Solving (Weighted) Partial MaxSAT with ILP. | Carlos Anstegui, Joel Gabs |
| 2013 | An Empirical Evaluation of Portfolios Approaches for Solving CSPs. | Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro |