Lately, I have been reading a lot of papers where the constraints have been tightened to include better formulations leading to decrease in optimiality gaps and also the time for solving the optimisation problem. I was wondering if there is a book or paper which folks would be aware about introducing constraint tightening in MIPs? I don't imagine it to be hit and trial approach, there definitely seems to be some good theory behind it.


1 Answer 1


The cutting plan algorithm is really a strange method to solve integer programming. In some cases, it works very well, and in some cases, it works vice versa. I think besides the theoretical overview of this method many trials and errors should be applied to understand how it works well on a specific problem. In this case, some resources that might be useful are:

  • $\begingroup$ My apologies for the late response. Thanks a lot! :) $\endgroup$
    – Ishaan
    Apr 4, 2022 at 17:52
  • $\begingroup$ @Ishaan, your welcome. 👍 $\endgroup$
    – A.Omidi
    Apr 5, 2022 at 0:53

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.