作者: Alexander Bockmayr , Nicolai Pisaruk , None
DOI:
关键词:
摘要: We study a hybrid MIP/CP solution approach in which CP is used for detecting infeasibilities and generating cuts within branch-and-cut algorithm MIP. Our framework applies to MIP problems augmented by monotone constraints that can be handled CP. illustrate our on generic multiple machine scheduling problem, compare it other algorithms.