Parametric maximal flows in generalized networks – complexity and algorithms

DOI10.1080/02331938808843341zbMath0662.90028OpenAlexW2055265214MaRDI QIDQ3813580

No author found.

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

worst-case analysisbreakpointshorizontal approximation methodnetworks with gainsparametric maximal flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)

Related Items (3)

Stability in vector optimization path problems ⋮ Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• Optimum flows in general communication networks
• Characterization of all optimal solutions and parametric maximal mows in networks
• Complexity of some parametric integer and network programming problems
• Computational complexity of parametric linear programming
• Calculating Maximal Flows in a Network with Positive Gains
• A bad network problem for the simplex method and other minimum cost flow algorithms

This page was built for publication: Parametric maximal flows in generalized networks – complexity and algorithms