Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476364 | Computers & Operations Research | 2006 | 10 Pages |
Abstract
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 present a number of computational experiments.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alexander Bockmayr, Nicolai Pisaruk,