We study a hybrid MIP/CP solution approach in which CP is used for detecting infeasibilities and generating cuts within a branch-and-cut algorithm for MIP. Our framework applies to MIP problems augmented by monotone constraints that can be handled by CP. We illustrate our approach on a generic multiple machine scheduling problem, and compare it to other… (More)
We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.
Assembly line balancing problems consist in partitioning the work necessary to assemble a number of products among diierent stations of an assembly line. We present a hybrid approach for solving such problems, which combines constraint programming and integer programming .
A well-known result on unions of polyhedra in the same space gives an extended formulation whose projection is the convex hull of the union. Here in contrast we study the unions of polytopes in different spaces, giving a complete description of the convex hull without additional variables. When the underlying polytopes are monotone, the facets are described… (More)