Characterization of all optimal solutions and parametric maximal mows in networks

DOI10.1080/02331938508842988zbMath0567.90024OpenAlexW2086300469MaRDI QIDQ3683846

No author found.

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508842988

zbMATH Keywords

decompositionall optimal solutionsmax flow problemparametric arc capacitiesepsilon flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (6)

Fuzzy optimal flow on imprecise structures ⋮ Interdicting the activities of a linear program -- a parametric analysis ⋮ Parametric maximal flows in generalized networks – complexity and algorithms ⋮ Algorithms for flows with parametric capacities ⋮ A note on the paper “characterization of all optimal solutions and parametric maximal flows in networks” of G. Ruhe (optimization 16 (1985) 1, 51-61) ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical investigations on the maximal flow algorithm of Karzanov
• Adjacent extreme flows and application to min concave cost flow problems
• On the structure of all minimum cuts in a network and applications
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints

This page was built for publication: Characterization of all optimal solutions and parametric maximal mows in networks