Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem (Q2172416): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2022.07.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2022.07.007 / rank | |||
Normal rank | |||
Latest revision as of 08:27, 17 December 2024
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
0 references
