Implementation of a unimodularity test

DOI10.1007/s12532-012-0048-xzbMath1262.05020arXiv1202.4061OpenAlexW2594833239MaRDI QIDQ1947200

Matthias Walter, Klaus Truemper

Publication date: 12 April 2013

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4061

zbMATH Keywords

unimodularitytotal unimodularitypolynomial test

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles ⋮ Notes on \(\{a,b,c\}\)-modular matrices ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Stable matching: An integer programming approach ⋮ Sparse recovery with integrality constraints ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Unimodularity Test ⋮ On the recognition of \(\{a,b,c\}\)-modular matrices ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Extended formulations for stable set polytopes of graphs without two disjoint odd cycles

Uses Software

• Unimodularity
• Boost
• Leibniz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theory for matroids. V: Testing of matrix total unimodularity
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Complement total unimodularity
• Decomposition of regular matroids
• A decomposition theory for matroids. VII: Analysis of minimal violation matrices
• Local unimodularity of matrix-vector pairs
• Converting Linear Programs to Network Problems
• Algebraic Characterizations of Unimodular Matrices
• Local Unimodularity in the Matching Polytope
• Random Graphs
• Minimum partition of a matroid into independent subsets