Titlebook: Integration of AI and OR Techniques in Constraint Programming; 11th International C Helmut Simonis Conference proceedings 2014 Springer Int

初學(xué)者

FOR

978-3-319-07045-2Springer International Publishing Switzerland 2014

古董

spinal-stenosis

Detecting and Exploiting Permutation Structures in MIPs,rmutation problems from their MIP formulation, and show how we can take advantage of this knowledge to speed up the solution process. Computational results on quadratic assignment and single machine scheduling problems show that the technique, when embedded in a state-of-the-art MIP solver, can indeed improve performance.

交響樂

A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes,ange of standard benchmark problems. Further investigation shows that the new MIP formulation improves on the existing formulation primarily by producing a much smaller model and enabling high quality primal solutions to be found very quickly.

ALIEN

The PrePack Optimization Problem,ning the number and contents of the box types, as well as the allocation of boxes to stores. This paper introduces the PrePack problem and proposes CP and MIP models and a metaheuristic approach to address it.

跑過

SAT and Hybrid Models of the Car Sequencing Problem,ear time mechanism for explaining failure and pruning the . constraint. In our SAT models, we give powerful encodings for the same constraint. Our research demonstrates the strength and complementarity of SAT and hybrid methods for solving difficult sequencing problems.

代理人

Stable Roommates and Constraint Programming,served that the n-ary constraint model can read in, model and output all matchings for instances with .?=?1,000 in about 2 seconds on current hardware platforms. Enumerating all matchings is a crude solution to the egalitarian SR problem, and the empirical results suggest that although NP-hard, egalitarian SR is practically easy.

fabricate

Tdd526