![Detecting infeasibility and generating cuts for mixed integer programming using constraint programming [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR8YRW.jpg)
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming [An article from: Computers and Operations Research]
Book Details
Author(s)
A. Bockmayr, N. Pisaruk
Publisher
Elsevier
ISBN / ASIN
B000RR8YRW
ISBN-13
978B000RR8YR8
Availability
Available for download now
Marketplace
United States 🇺🇸
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
