Cancel-and-tighten algorithm for quickest flow problems (Q4565782)
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 6887379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cancel-and-tighten algorithm for quickest flow problems |
scientific article; zbMATH DE number 6887379 |
Statements
Cancel-and-tighten algorithm for quickest flow problems (English)
0 references
13 June 2018
0 references
network optimization
0 references
dynamic flow
0 references
quickest flow
0 references
cost scaling
0 references
cancel and tighten algorithm
0 references
strongly polynomial time algorithm
0 references
0.8865246772766113
0 references
0.8775177597999573
0 references
0.8775177597999573
0 references
0.8282246589660645
0 references
