Pages that link to "Item:Q1103625"
From MaRDI portal
The following pages link to A decomposition theory for matroids. V: Testing of matrix total unimodularity (Q1103625):
Displaying 14 items.
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- A decomposition theory for matroids. VI: Almost regular matroids (Q1204475) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Implementation of a unimodularity test (Q1947200) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
- Binary signed-graphic matroids: representations and recognition algorithms (Q2182208) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Signed-graphic matroids with all-graphic cocircuits (Q2404380) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (Q5891167) (← links)
- Counting vertices of integral polytopes defined by facets (Q6050234) (← links)
