On the recognition of \(\{a,b,c\}\)-modular matrices

DOI10.1007/978-3-030-73879-2_17zbMath1484.15038OpenAlexW3165123938MaRDI QIDQ2061884

Christoph Glanzer, Ingo Stallknecht, Robert Weismantel

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-73879-2_17

zbMATH Keywords

recognition algorithminteger optimizationbounded subdeterminants

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Numerical linear algebra (65F99)

Related Items

Notes on \(\{a,b,c\}\)-modular matrices, Advances on strictly \(\varDelta \)-modular IPs, On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On integer programming with bounded determinants
• Integer program with bimodular matrix
• A decomposition theory for matroids. V: Testing of matrix total unimodularity
• Decomposition of regular matroids
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
• A note on non-degenerate integer programs with small sub-determinants
• Implementation of a unimodularity test
• Submodular minimization under congruency constraints
• Geometric random edge
• On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
• A strongly polynomial algorithm for bimodular integer linear programming
• The Integrality Number of an Integer Program
• The stable set problem in graphs with bounded genus and bounded odd cycle packing number
• On sub-determinants and the diameter of polyhedra