Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

0.00 Avg rating0 Votes
Article ID: iaor20072580
Country: United Kingdom
Volume: 33
Issue: 10
Start Page Number: 2777
End Page Number: 2786
Publication Date: Oct 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: constraints
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.

Reviews

Required fields are marked *. Your email address will not be published.