Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of some parametric integer and network programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving Bicriterion Mathematical Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank | |||
Normal rank | |||
Latest revision as of 16:44, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh |
scientific article |
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
