Abstract is missing.
- Sharpening Constraint Programming Approaches for Bit-Vector TheoryZakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin. 3-20 [doi]
- Range-Consistent Forbidden Regions of Allen's RelationsNicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'homme, Andreas Schutt, Peter J. Stuckey. 21-29 [doi]
- MDDs are Efficient Modeling Tools: An Application to Some Statistical ConstraintsGuillaume Perez, Jean-Charles Régin. 30-40 [doi]
- On Finding the Optimal BDD RelaxationDavid Bergman, André Augusto Ciré. 41-50 [doi]
- Design and Implementation of Bounded-Length Sequence VariablesJoseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte. 51-67 [doi]
- In Search of Balance: The Challenge of Generating Balanced Latin RectanglesMateo Díaz, Ronan Le Bras, Carla P. Gomes. 68-76 [doi]
- Debugging Unsatisfiable Constraint ModelsKevin Leo, Guido Tack. 77-93 [doi]
- Learning Decision Trees with Flexible Constraints and Objectives Using Integer OptimizationSicco Verwer, Yingqian Zhang. 94-103 [doi]
- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials DiscoveryJunwen Bai, Johan Bjorck, Yexiang Xue, Santosh K. Suram, John M. Gregoire, Carla P. Gomes. 104-112 [doi]
- Minimizing Landscape Resistance for Habitat ConservationDiego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey. 113-130 [doi]
- A Hybrid Approach for Stator Winding Design OptimizationAlessandro Zanarini, Jan Poland. 131-146 [doi]
- A Distributed Optimization Method for the Geographically Distributed Data Centres ProblemMohamed Wahbi, Diarmuid Grimes, Deepak Mehta, Kenneth N. Brown, Barry O'Sullivan. 147-166 [doi]
- Explanation-Based Weighted DegreeEmmanuel Hebrard, Mohamed Siala 0002. 167-175 [doi]
- Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree ProblemsAntoine Delaite, Gilles Pesant. 176-184 [doi]
- The Weighted Arborescence ConstraintVinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence Wolsey. 185-201 [doi]
- Learning When to Use a DecompositionMarkus Kruber, Marco E. Lübbecke, Axel Parmentier. 202-210 [doi]
- Experiments with Conflict Analysis in Mixed Integer ProgrammingJakob Witzig, Timo Berthold, Stefan Heinz. 211-220 [doi]
- A First Look at Picking Dual Variables for Maximizing Reduced Cost FixingOmid Sanei Bajgiran, André A. Ciré, Louis-Martin Rousseau. 221-228 [doi]
- Experimental Validation of Volume-Based Comparison for Double-McCormick RelaxationsEmily Speakman, Han Yu, Jon Lee. 229-243 [doi]
- Minimum Makespan Vehicle Routing Problem with Compatibility ConstraintsMiao Yu, Viswanath Nagarajan, Siqian Shen. 244-253 [doi]
- Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded NetworksNatashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh. 254-262 [doi]
- A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological NetworksMurodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni. 263-276 [doi]
- Scenario-Based Learning for Stochastic Combinatorial OptimisationDavid Hemmi, Guido Tack, Mark Wallace. 277-292 [doi]
- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic DemandsAlessandro Zanarini. 293-301 [doi]
- Stochastic Task Networks - Trading Performance for StabilityKiriakos Simon Mountakis, Tomas Klos, Cees Witteveen. 302-311 [doi]
- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval VariablesQuentin Cappart, Pierre Schaus. 312-327 [doi]
- Dynamic Temporal DecouplingKiriakos Simon Mountakis, Tomas Klos, Cees Witteveen. 328-343 [doi]
- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling ProblemLucas Kletzander, Nysret Musliu. 344-358 [doi]
- Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring ProblemMaël Minot, Samba Ndojh Ndiaye, Christine Solnon. 359-375 [doi]
- htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and BeyondMichael Abseher, Nysret Musliu, Stefan Woltran. 376-386 [doi]
- The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSPHong Xu, T. K. Satish Kumar, Sven Koenig. 387-402 [doi]
- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling ProblemsMirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh. 403-418 [doi]