A continuous-time network simplex algorithm (Q3826337)
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 4100918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A continuous-time network simplex algorithm |
scientific article; zbMATH DE number 4100918 |
Statements
A continuous-time network simplex algorithm (English)
0 references
1989
0 references
least-cost flow
0 references
upper bound constraints
0 references
minimum-cost network flow
0 references
flow-conservation constraint
0 references
arc capacities
0 references
infinite-dimensional linear program
0 references
network simplex algorithm
0 references
0.859228253364563
0 references
0.8578861355781555
0 references
0.8546833992004395
0 references
0.8506143689155579
0 references
