Computing monotone disjoint paths on polytopes (Q1016050)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5550482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing monotone disjoint paths on polytopes |
scientific article; zbMATH DE number 5550482 |
Statements
Computing monotone disjoint paths on polytopes (English)
0 references
4 May 2009
0 references
polytopes
0 references
linear programming
0 references
reverse search
0 references
vertex enumeration
0 references
disjoint paths
0 references
network flow
0 references
simplex method
0 references
degeneracy
0 references
Holt-Klee
0 references
0 references
0.7852316498756409
0 references
0.7607400417327881
0 references
0.7478817701339722
0 references
0.723835825920105
0 references
