The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems

DOI10.1016/S0167-5060(08)70819-7zbMath0411.05011MaRDI QIDQ4198768

Alan J. Hoffman

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

zbMATH Keywords

linear programmingdualityunimodularitylattice polyhedracombinatorial theoremspolyhedral combinatoricsunimodular matricesmatching polytopesperfect matricesbalanced matricesapplication of linear inequalitiesEgervary-König theoremflow polyhedra

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Enumerative combinatorics (05A99) Matrices of integers (15B36)

Related Items

Semiantichains and Unichain Coverings in Direct Products of Partial Orders, A short proof of the two-commodity flow theorem, Maximum Rank of Powers of a Matrix of a Given Pattern, A combinatorial abstraction of linear programming, An out-of-kilter method for the algebraic circulation problem