This paper describes an integration of finite do main Constraint Programming techniques into Mathematical Programming. Firstly, it outlines some corresponding and complementary features of the two methods. This is followed by an overview on theimplementation which is based on a commercial linear mixed-integer tool and a finite domain CP solver over unions of integer intervals. Concluding, a short summary of first results obtained with this new approach is given.
展开▼
