Shortest path and maximum flow problems in networks with additive losses and gains (Q620954)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path and maximum flow problems in networks with additive losses and gains |
scientific article |
Statements
Shortest path and maximum flow problems in networks with additive losses and gains (English)
0 references
2 February 2011
0 references
extended networks
0 references
lossy and gainy arcs
0 references
max-flow problems
0 references
shortest path problems
0 references
NP-hard problems
0 references
unit-loss networks
0 references
0 references
