Titlebook: Integration of AI and OR Techniques in Constraint Programming; 13th International C Claude-Guy Quimper Conference proceedings 2016 Springer

虛弱的神經(jīng)

Morbid

公司

A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placementation Evolution Strategy (CMA-ES) solver. We illustrate this approach with the declarative modeling and solving of hard geometrical placement problems, motivated by packing applications in logistics involving mixed square-curved shapes and complex shapes defined by Bézier curves.

即席

Finding a Collection of MUSes Incrementally,s methods for finding multiple . by computing its . incrementally. This allows it to generate multiple . more efficiently; making it more feasible to supply applications with a collection of . rather than just one.

CALL

Decomposition Based on Decision Diagrams,using a DD. This technique is applied to a special case of the independent set problem and to unconstrained binary quadratic programming. Preliminary computational results suggest that the proposed decomposition approach can improve upon both standard integer programming models and a single DD approach.

過度

Weighted Spanning Tree Constraint with Explanations,In this paper we implement this constraint using a lower bound and learning to accelerate the search and thus reduce the solving time. We show that having this propagator is tremendously beneficial for solvers and we show the benefits of learning.

劇本

喧鬧

A Reservoir Balancing Constraint with Applications to Bike-Sharing,ulting CP approach outperforms a Branch-and-Bound approach derived from two closely related problems. In addition, the CP approach presented in this paper resulted in a first place position in the competition.

Frisky

廢除