Accepted Papers
Elena Kelareva, Kevin Tierney and Philip Kilby
Scheduling and Routing with Time-Dependent Task Costs
Laura Climent, Richard J. Wallace, Miguel A. Salido and Federico Barber
Modeling Robustness in CSPs as Weighted CSPs
John Hooker
Decision diagrams and dynamic programming
Marijn Heule, Matti Järvisalo and Armin Biere
Revisiting Hyper Binary Resolution
Domenico Salvagnin
Orbital Shrinking: a new tool for hybrid MIP/CP methods
Peter Stuckey and Guido Tack
MiniZinc with Functions
Arnaud Letort, Nicolas Beldiceanu and Mats Carlsson
A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint
Andreas Schutt, Thibaut Feydy and Peter Stuckey
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
Axel Nyberg, Tapio Westerlund and Andreas Lundell
Improved Discrete Reformulations for the Quadratic Assignment Problem
Brian Kell and Willem-Jan van Hoeve
An MDD Approach to Multidimensional Bin Packing
Eduardo Álvarez-Miranda, Ivana Ljubic and Petra Mutzel
The Rooted Maximum Node-Weight Connected Subgraph Problem
Achref El Mouelhi, Philippe Jegou, Cyril Terrioux and Bruno Zanuttini
Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms
Timo Berthold and Domenico Salvagnin
Cloud branching
Mark Liffiton and Ammar Malik
Enumerating Infeasibility: Finding Multiple MUSes Quickly
Marla Slusky and Willem-Jan Van Hoeve
A Lagrangean Relaxation for Golomb Rulers
Tobias Achterberg, Ashish Sabharwal and Horst Samulowitz
Stronger Inference Through Implied Literals From Conflicts and Knapsack Covers
Hermann Schichl, Arnold Neumaier, Mihaly Csaba Markot and Ferenc Domes
Projective and asymptotic constraint propagation and relaxation methods for unbounded mixed-integer CSPs
Yuri Malitsky, Deepak Mehta, Barry O'Sullivan and Helmut Simonis
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
Peter Y. Zhang, David A. Romero, J. Christopher Beck and Cristina H. Amon
Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming
Stefan Heinz, Wen-Yang Ku and Chris Beck
Recent improvements using constraint integer programming for resource allocation and scheduling problems
Andre Cire, Elvin Coban and John Hooker
Mixed integer programming vs logic-based Benders decomposition for planning and scheduling
Udara Weerakoon and Vicki Allan
Coalition Formation for Servicing Dynamic Motion Tasks
Hanyu Gu, Andreas Schutt and Peter Stuckey
A Lagrangian Relaxation Based Forward-backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects
Nina Narodytska and Toby Walsh
An Adaptive Model Restarts Heuristic
Ioannis Mourtos
Tight LP-relaxations of overlapping global cardinality constraints
Ambros Gleixner and Stefan Weltge
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
Roberto Amadini, Maurizio Gabbrielli and Jacopo Mauro
An Empirical Evaluation of Portfolios Approaches for solving CSPs
Duc-Cuong Dang, Racha El Hajj and Aziz Moukrim
A branch-and-Cut algorithm for solving the Team Orienteering Problem
Gerald Gamrath
Improving strong branching by propagation
Jiadong Wang and Ted Ralphs
Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Integer Programming
Abdelilah Sakti, Yann-Gaël Guéhéneuc and Gilles Pesant
Constraint-Based Fitness Function for Search-Based Software Testing
Carlos Ansótegui and Joel Gabàs
Solving (Weighted) Partial MaxSAT with ILP
[pdf]
