Exploiting patterns to reduce IP coefficient matrices

In this report, we present a novel method to reduce the non-zero factors in the coefficient matrices of integer programming problems by extracting coefficient patterns that appear frequently in the coefficient matrix and by replacing these patterns with new variables. Using this method, we can effectively reduce the memory requirements for maintaining the data structures, and for solving IP problems with IP solvers.

By: Takayuki Yoshizumi

Published in: RT0712 in 2007


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 .