We describe an implementation of a separation procedure for mixed integer rounding (MIR) inequalities originally proposed by Marchand and Wolsey in 1998. This implementation is included in the Cut Generator Library of the Computational Infrastructure for Operations Research (COIN-OR), which is an initiative of open source software for Operations Research. We detail the three heuristic steps of the separation procedure and provide details of our implementation. We also give useful information for those who want to use it and for those who want to implement other cut separation procedures. Finally, we give results of computational experiments with a standard set of mixed integer problem instances and show that the performance of our implementation is comparable with other implementations.
By: João P. M. Gonçalves; Laszlo Ladanyi
Published in: RC23686 in 2005
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .