Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
integer programming
network flow problems |
| gptkbp:citation |
Schrijver, Alexander. Theory of Linear and Integer Programming
Cunningham, W. H. (1982). Testing membership in matroid polyhedra. |
| gptkbp:defines |
A matrix in which every square submatrix has determinant 0, 1, or -1
|
| gptkbp:example |
incidence matrix of a bipartite graph
network matrix |
| gptkbp:field |
combinatorial optimization
linear algebra |
| https://www.w3.org/2000/01/rdf-schema#label |
Totally unimodular matrix
|
| gptkbp:implies |
if the constraint matrix of a linear program is totally unimodular and the right-hand side is integral, then every vertex solution is integral
|
| gptkbp:introducedIn |
1935
|
| gptkbp:namedFor |
gptkb:Hassler_Whitney
|
| gptkbp:property |
all entries are 0, 1, or -1
the transpose is also totally unimodular |
| gptkbp:relatedTo |
incidence matrix
unimodular matrix |
| gptkbp:bfsParent |
gptkb:Integer_Linear_Programming
|
| gptkbp:bfsLayer |
8
|