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

Authors:
William H. Cunningham;Jim Geelen
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, N2L 3G1, Canada;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, N2L 3G1, Canada
Venue:
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Year:
2007

Citing 8
Cited 1

Improved bounds for matroid partition and intersection algorithms

SIAM Journal on Computing
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
On the complexity of integer programming

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
Testing branch-width

Journal of Combinatorial Theory Series B

The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider an integer program max (ctx: 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 Ais non-negative and the column-matroid of Ahas constant branch-width.