|
|
|
|
Sharpening Constraint Programming Approaches for Bit-Vector Theory |
|
|
3 | (18) |
|
|
|
|
|
|
|
|
|
Range-Consistent Forbidden Regions of Allen's Relations |
|
|
21 | (9) |
|
|
|
|
|
|
|
|
|
|
|
|
|
MDDs are Efficient Modeling Tools: An Application to Some Statistical Constraints |
|
|
30 | (11) |
|
|
|
|
|
On Finding the Optimal BDD Relaxation |
|
|
41 | (10) |
|
|
|
|
|
Design and Implementation of Bounded-Length Sequence Variables |
|
|
51 | (17) |
|
|
|
|
|
|
|
|
|
In Search of Balance: The Challenge of Generating Balanced Latin Rectangles |
|
|
68 | (9) |
|
|
|
|
|
|
|
Debugging Unsatisfiable Constraint Models |
|
|
77 | (17) |
|
|
|
|
|
Learning Decision Trees with Flexible Constraints and Objectives Using Integer Optimization |
|
|
94 | (10) |
|
|
|
|
|
Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery |
|
|
104 | (9) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Minimizing Landscape Resistance for Habitat Conservation |
|
|
113 | (18) |
|
|
|
|
|
|
|
|
|
A Hybrid Approach for Stator Winding Design Optimization |
|
|
131 | (16) |
|
|
|
|
|
A Distributed Optimization Method for the Geographically Distributed Data Centres Problem |
|
|
147 | (20) |
|
|
|
|
|
|
|
|
|
|
|
Explanation-Based Weighted Degree |
|
|
167 | (9) |
|
|
|
|
|
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems |
|
|
176 | (9) |
|
|
|
|
|
The Weighted Arborescence Constraint |
|
|
185 | (17) |
|
Vinasetan Ratheil Houndji |
|
|
|
|
Mahouton Norbert Hounkonnou |
|
|
|
|
Learning When to Use a Decomposition |
|
|
202 | (9) |
|
|
|
|
|
|
|
Experiments with Conflict Analysis in Mixed Integer Programming |
|
|
211 | (10) |
|
|
|
|
|
|
|
A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing |
|
|
221 | (8) |
|
|
|
|
|
|
|
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations |
|
|
229 | (15) |
|
|
|
|
|
|
|
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints |
|
|
244 | (10) |
|
|
|
|
|
|
|
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks |
|
|
254 | (9) |
|
|
|
|
|
|
|
|
|
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks |
|
|
263 | (14) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Scenario-Based Learning for Stochastic Combinatorial Optimisation |
|
|
277 | (16) |
|
|
|
|
|
|
|
Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands |
|
|
293 | (9) |
|
|
|
Stochastic Task Networks: Trading Performance for Stability |
|
|
302 | (10) |
|
|
|
|
|
|
|
Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables |
|
|
312 | (16) |
|
|
|
|
|
Dynamic Temporal Decoupling |
|
|
328 | (16) |
|
|
|
|
|
|
|
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem |
|
|
344 | (15) |
|
|
|
|
|
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem |
|
|
359 | (17) |
|
|
|
|
|
|
|
HTD -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond |
|
|
376 | (11) |
|
|
|
|
|
|
|
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP |
|
|
387 | (16) |
|
|
|
|
|
|
|
A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems |
|
|
403 | (16) |
|
|
|
|
|
|
|
|
|
|
| Author Index |
|
419 | |
Lisainfo e-raamatute kohta