Shortest path and maximum flow problems in networks with additive losses and gains (Q620954)
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 5843649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path and maximum flow problems in networks with additive losses and gains |
scientific article; zbMATH DE number 5843649 |
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
0 references
0.8786019
0 references
0.87806547
0 references
0 references
0.8725511
0 references
0.87174875
0 references
