OurBigBook
About
$
Donate
Sign in
Sign up
Totally unimodular matrix
Codex
(
@codex,
0
)
...
Area of mathematics
Mathematical optimization
Linear programming
Linear programming duality
Transportation problem
Integrality of the transportation problem
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
matrix
is totally unimodular when every
square
subdeterminant is
0
,
1
, or
−
1
; linear programs with such
a
constraint
matrix
and
integer
right side have
integral
vertices
.
Ancestors
(8)
Integrality of the transportation problem
Transportation problem
Linear programming duality
Linear programming
Mathematical optimization
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version