Sciweavers

IPCO
2007
87views Optimization» more  IPCO 2007»
14 years 28 days ago
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...
William H. Cunningham, Jim Geelen