Total unimodularity and combinatorial theorems
From MaRDI portal
(Redirected from Publication:1144100)
Cites work
- Disjoint Transversals of Subsets
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3315023 (Why is no real title available?)
- Modules unimodulaires
- Transversal theory. An account of some aspects of combinatorial mathematics
Cited in
(8)- Optimisation and hypergraph theory
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
- Bounds of characteristic polynomials of regular matroids
- 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
- From finite vector field data to combinatorial dynamical systems in the sense of Forman
- Random allocations of multiple objects with incomplete information
This page was built for publication: Total unimodularity and combinatorial theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144100)