Total weak unimodularity: Testing and applications

DOI10.1016/0012-365X(84)90067-0zbMath0546.15004MaRDI QIDQ798401

R. Chandrasekaran, S. Shirali

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hilbert propertyintegral vectorpolynomially bounded algorithmtotally weakly unimodular

Mathematics Subject Classification ID

Related Items (2)

Total dual integrality implies local strong unimodularity ⋮ Integral infeasibility and testing total dual integrality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On total dual integrality
• The matroids with the max-flow min-cut property
• Dual integrality in b-matching problems
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Cyclic Scheduling via Integer Programs with Circular Ones
• Polynomial Algorithms for Totally Dual Integral Systems and Extensions
• Finite checkability for integer rounding properties in combinatorial programming problems
• A generalization of max flow—min cut
• Some Basis Theorems for Integral Monoids
• Packing rooted directed cuts in a weighted directed graph
• Minimum partition of a matroid into independent subsets
• Balanced matrices
• Blocking and anti-blocking pairs of polyhedra
• Matroids and the greedy algorithm
• Two-commodity cut-packing problem

This page was built for publication: Total weak unimodularity: Testing and applications