On Integer Programming and the Branch-Width of the Constraint Matrix
From MaRDI portal
Recommendations
- On the optimality of pseudo-polynomial algorithms for integer programming
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- On the optimality of pseudo-polynomial algorithms for integer programming
- A strongly polynomial algorithm for bimodular integer linear programming
- Integer programming and incidence treedepth
Cited in
(18)- The complexity landscape of decompositional parameters for ILP
- New limits of treewidth-based tractability in optimization
- Branch decomposition heuristics for linear matroids
- On the optimality of pseudo-polynomial algorithms for integer programming
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- LP formulations for polynomial optimization problems
- scientific article; zbMATH DE number 1406243 (Why is no real title available?)
- On the optimality of pseudo-polynomial algorithms for integer programming
- Finding branch-decompositions of matroids, hypergraphs, and more
- On the path-width of integer linear programming
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Tangle bases: Revisited
- Complexity of optimizing over the integers
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
- Designing compact ILPs via fast witness verification
This page was built for publication: On Integer Programming and the Branch-Width of the Constraint Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429265)
