Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689)
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: Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains |
scientific article; zbMATH DE number 5578459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains |
scientific article; zbMATH DE number 5578459 |
Statements
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (English)
0 references
14 July 2009
0 references
extended networks
0 references
lossy and gainy arcs
0 references
max-flow
0 references
shortest path
0 references
NP-hard
0 references
unit-loss networks
0 references
0 references
