Abstract is missing.
- A Time-Dependent No-Overlap Constraint: Application to Urban Delivery ProblemsPenélope Aguiar Melgarejo, Philippe Laborie, Christine Solnon. 1-17 [doi]
- Rectangle Placement for VLSI TestingMerav Aharoni, Odellia Boni, Ari Freund, Lidor Goren, Wesam Ibraheem, Tamir Segev. 18-30 [doi]
- A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree ProblemAlejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada. 31-46 [doi]
- A Benders Approach to the Minimum Chordal Completion ProblemDavid Bergman, Arvind U. Raghunathan. 47-64 [doi]
- MaxSAT-Based Scheduling of B2B MeetingsMiquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret. 65-73 [doi]
- Embedding Decision Trees and Random Forests in Constraint ProgrammingAlessio Bonfietti, Michele Lombardi, Michela Milano. 74-90 [doi]
- Scheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: A Mine Planning Case StudyChristina N. Burt, Nir Lipovetzky, Adrian R. Pearce, Peter J. Stuckey. 91-107 [doi]
- Learning Value Heuristics for Constraint ProgrammingGeoffrey Chu, Peter J. Stuckey. 108-123 [doi]
- Derivative-Free Optimization: Lifting Single-Objective to Multi-Objective AlgorithmCyrille Dejemeppe, Pierre Schaus, Yves Deville. 124-140 [doi]
- Branching on Multi-aggregated VariablesGerald Gamrath, Anna Melchiori, Timo Berthold, Ambros M. Gleixner, Domenico Salvagnin. 141-156 [doi]
- Time-Table Disjunctive Reasoning for the Cumulative ConstraintSteven Gay, Renaud Hartert, Pierre Schaus. 157-172 [doi]
- Uncertain Data Dependency Constraints in Matrix ModelsCarmen Gervet, Sylvie Galichet. 173-181 [doi]
- An Efficient Local Search for Partial Latin Square Extension ProblemKazuya Haraguchi. 182-198 [doi]
- Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo CostsGregor Hendel. 199-214 [doi]
- BDD-Guided Clause GenerationBrian Kell, Ashish Sabharwal, Willem Jan van Hoeve. 215-230 [doi]
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack ProblemWen-Yang Ku, J. Christopher Beck. 231-239 [doi]
- Large Neighborhood Search for Energy Aware Meeting Scheduling in Smart BuildingsBoonPing Lim, Menkes van den Briel, Sylvie Thiébaux, Russell Bent, Scott Backhaus. 240-254 [doi]
- ILP and CP Formulations for the Lazy Bureaucrat ProblemFabio Furini, Ivana Ljubic, Markus Sinnl. 255-270 [doi]
- The Smart Table ConstraintJean-Baptiste Mairy, Yves Deville, Christophe Lecoutre. 271-287 [doi]
- Constraint-Based Sequence Mining Using Constraint ProgrammingBenjamin Négrevergne, Tias Guns. 288-305 [doi]
- A Comparative Study of MIP and CP Formulations for the B2B Scheduling Optimization ProblemGilles Pesant, Gregory Rix, Louis-Martin Rousseau. 306-321 [doi]
- Constraint-Based Local Search for Golomb RulersM. M. Alam Polash, M. A. Hakim Newton, Abdul Sattar. 322-331 [doi]
- Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack ProblemsSergey Polyakovskiy, Frank Neumann. 332-346 [doi]
- MaxSAT-Based Cutting Planes for Learning Graphical ModelsPaul Saikko, Brandon Malone, Matti Järvisalo. 347-356 [doi]
- A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTWMichael Saint-Guillain, Yves Deville, Christine Solnon. 357-374 [doi]
- Constraint Solving on Bounded String VariablesJoseph D. Scott, Pierre Flener, Justin Pearson. 375-392 [doi]
- Freight Train Threading with Different AlgorithmsIlankaikone Senthooran, Mark Wallace, Leslie De Koninck. 393-409 [doi]
- Learning General Constraints in CSPMichael Veksler, Ofer Strichman. 410-426 [doi]
- Understanding the Potential of PropagatorsSascha Van Cauwelaert, Michele Lombardi, Pierre Schaus. 427-436 [doi]
- Failure-Directed Search for Constraint-Based SchedulingPetr Vilím, Philippe Laborie, Paul Shaw. 437-453 [doi]