On Integer Programming and the Branch-Width of the Constraint Matrix

Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial time when A is non-negative and the column-matroid of A has constant branch-width.

• Type: Conference
• Year: 2007
• Where: IPCO
• Authors: William H. Cunningham, Jim Geelen
• Keywords: Constant Branch-width, Integer Program, IPCO 2007, Optimization, Pseudo-polynomial Time