Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh |
scientific article; zbMATH DE number 4045460 |
Statements
Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (English)
0 references
1988
0 references
multicriterial flows
0 references
network flow problems
0 references
worst-case analysis
0 references
pathological graph
0 references
exponential number of breakpoints
0 references
parametric capacities
0 references
bicriterial min-cost flow
0 references
0.8626728
0 references
0.8488765
0 references
0.83740103
0 references
0.8360184
0 references
