Total unimodularity and combinatorial theorems
From MaRDI portal
Publication:1144100
DOI10.1016/0024-3795(76)90047-1zbMath0443.15013OpenAlexW2059312013MaRDI QIDQ1144100
Publication date: 1976
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(76)90047-1
Related Items (6)
Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups ⋮ The setup carryover assignment problem ⋮ Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming ⋮ Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach ⋮ Bounds of characteristic polynomials of regular matroids ⋮ Optimisation and hypergraph theory
Cites Work
This page was built for publication: Total unimodularity and combinatorial theorems