Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
First order convergence of matroids
$N$-fold integer programming
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
Partitioning mathematical programs for parallel solution
Decomposition of test sets in stochastic integer programming
The complexity landscape of decompositional parameters for ILP
On infinite antichains of matroids
$n$-fold integer programming in cubic time
About the complexity of two-stage stochastic IPs
Branch-depth: generalizing tree-depth of graphs
Integer programming and incidence treedepth
Scheduling meets $n$-fold integer programming
Finiteness theorems in stochastic integer programming
Branch-width, parse trees, and monadic second-order logic for matroids.
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Integer Programming with a Fixed Number of Variables
Reformulation and Decomposition of Integer Programs
Minkowski's Convex Body Theorem and Integer Programming
Decomposing Matrices into Blocks
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
Reducibility among Combinatorial Problems
Faster Algorithms for Integer Programs with Block Structure
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
Structure Detection in Mixed-Integer Programs
Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
Parameterized Algorithms
Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
The double exponential runtime is tight for 2-stage stochastic ILPs
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
Collapsing the tower -- on the complexity of multistage stochastic IPs

This page was built for publication: Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634533)