A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time algorithm for the minimum flow problem in time-varying networks |
scientific article; zbMATH DE number 7032635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for the minimum flow problem in time-varying networks |
scientific article; zbMATH DE number 7032635 |
Statements
A polynomial time algorithm for the minimum flow problem in time-varying networks (English)
0 references
6 March 2019
0 references
network flows
0 references
combinatorial optimization
0 references
(dynamic) minimum flow
0 references
(dynamic) preflow-pull algorithm
0 references
0 references
0.9250456690788268
0 references
0.878204882144928
0 references
0.8532236218452454
0 references
