Congruency-constrained TU problems beyond the bimodular case

DOI10.1137/1.9781611977073.108MaRDI QIDQ6575183zbMATH OpenFDO

Authors Martin Nägele, Richard Santiago, Rico Zenklusen

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.108

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(9)

• On the maximal number of columns of a -modular integer matrix: bounds and computations
• Extended formulations for the integer hull of strictly -modular cographic polyhedral cones
• Advances on strictly -modular IPs
• On the size of integer programs with bounded non-vanishing subdeterminants
• On the congruency-constrained matroid base
• On matrices over a polynomial ring with restricted subdeterminants
• Total matching and subdeterminants
• Lattice structure and efficient basis construction for strongly connected orientations
• A brief history of parameterized algorithms for block-structured integer programs (invited talk)

This page was built for publication: Congruency-constrained TU problems beyond the bimodular case

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