On Integer Programming and the Branch-Width of the Constraint Matrix
From MaRDI portal
Publication:5429265
DOI10.1007/978-3-540-72792-7_13zbMath1136.90403OpenAlexW6467814MaRDI QIDQ5429265
William H. Cunningham, Jim Geelen
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_13
Related Items (10)
Tangle bases: Revisited ⋮ Complexity of optimizing over the integers ⋮ On the optimality of pseudo-polynomial algorithms for integer programming ⋮ Branch decomposition heuristics for linear matroids ⋮ LP Formulations for Polynomial Optimization Problems ⋮ On the Optimality of Pseudo-polynomial Algorithms for Integer Programming ⋮ The complexity landscape of decompositional parameters for ILP ⋮ Finding Branch-Decompositions of Matroids, Hypergraphs, and More ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming ⋮ New limits of treewidth-based tractability in optimization
This page was built for publication: On Integer Programming and the Branch-Width of the Constraint Matrix
