Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem (Q2172416)
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: Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem |
scientific article |
Statements
Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem (English)
0 references
15 September 2022
0 references
minimum cost flow
0 references
\(K\) best network flow
0 references
integer network flow algorithm
0 references
all optimal solutions
0 references
combinatorial optimization
0 references
