Abstract is missing.
- Stronger Inference through Implied Literals from Conflicts and Knapsack CoversTobias Achterberg, Ashish Sabharwal, Horst Samulowitz. 1-11 [doi]
- Recent Improvements Using Constraint Integer Programming for Resource Allocation and SchedulingStefan Heinz, Wen-Yang Ku, J. Christopher Beck. 12-27 [doi]
- Cloud BranchingTimo Berthold, Domenico Salvagnin. 28-43 [doi]
- Modeling Robustness in CSPs as Weighted CSPsLaura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber. 44-60 [doi]
- Some New Tractable Classes of CSPs and Their Relations with Backtracking AlgorithmsAchref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini. 61-76 [doi]
- Revisiting Hyper Binary ResolutionMarijn Heule, Matti Järvisalo, Armin Biere. 77-93 [doi]
- Decision Diagrams and Dynamic ProgrammingJohn N. Hooker. 94-110 [doi]
- CP Methods for Scheduling and Routing with Time-Dependent Task CostsElena Kelareva, Kevin Tierney, Philip Kilby. 111-127 [doi]
- An MDD Approach to Multidimensional Bin PackingBrian Kell, Willem Jan van Hoeve. 128-143 [doi]
- k-dimensional cumulative ConstraintArnaud Letort, Mats Carlsson, Nicolas Beldiceanu. 144-159 [doi]
- Enumerating Infeasibility: Finding Multiple MUSes QuicklyMark H. Liffiton, Ammar Malik. 160-175 [doi]
- Tuning Parameters of Large Neighborhood Search for the Machine Reassignment ProblemYuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis. 176-192 [doi]
- Improved Discrete Reformulations for the Quadratic Assignment ProblemAxel Nyberg, Tapio Westerlund, Andreas Lundell. 193-203 [doi]
- Orbital Shrinking: A New Tool for Hybrid MIP/CP MethodsDomenico Salvagnin. 204-215 [doi]
- On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded VariablesHermann Schichl, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes. 216-233 [doi]
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource ConstraintAndreas Schutt, Thibaut Feydy, Peter J. Stuckey. 234-250 [doi]
- A Lagrangian Relaxation for Golomb RulersMarla R. Slusky, Willem Jan van Hoeve. 251-267 [doi]
- MiniZinc with FunctionsPeter J. Stuckey, Guido Tack. 268-283 [doi]
- Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint ProgrammingPeter Y. Zhang, David A. Romero, J. Christopher Beck, Cristina H. Amon. 284-299 [doi]
- The Rooted Maximum Node-Weight Connected Subgraph ProblemEduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel. 300-315 [doi]
- An Empirical Evaluation of Portfolios Approaches for Solving CSPsRoberto Amadini, Maurizio Gabbrielli, Jacopo Mauro. 316-324 [doi]
- Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and SchedulingAndré A. Ciré, Elvin Coban, John N. Hooker. 325-331 [doi]
- A Branch-and-Cut Algorithm for Solving the Team Orienteering ProblemDuc-Cuong Dang, Racha El-Hajj, Aziz Moukrim. 332-339 [doi]
- A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained ProjectsHanyu Gu, Andreas Schutt, Peter J. Stuckey. 340-346 [doi]
- Improving Strong Branching by PropagationGerald Gamrath. 347-354 [doi]
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear ProgrammingAmbros M. Gleixner, Stefan Weltge. 355-361 [doi]
- Tight LP-Relaxations of Overlapping Global Cardinality ConstraintsIoannis Mourtos. 362-368 [doi]
- An Adaptive Model Restarts HeuristicNina Narodytska, Toby Walsh. 369-377 [doi]
- Constraint-Based Fitness Function for Search-Based Software TestingAbdelilah Sakti, Yann-Gaël Guéhéneuc, Gilles Pesant. 378-385 [doi]
- Coalition Formation for Servicing Dynamic Motion TasksUdara Weerakoon, Vicki Allan. 386-393 [doi]
- Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete OptimizationJiadong Wang, Ted K. Ralphs. 394-402 [doi]
- Solving (Weighted) Partial MaxSAT with ILPCarlos Ansótegui, Joel Gabàs. 403-409 [doi]