Algorithms for flows with parametric capacities

DOI10.1007/BF01415514zbMath0669.90042OpenAlexW2016439397MaRDI QIDQ3823390

Les R. Foulds, Horst W. Hamacher

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415514

zbMATH Keywords

labelingapproximationparametric linear programmaximal flowsconditional flow augmenting pathsvertical algorihm

Mathematics Subject Classification ID

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

Related Items

Minimum parametric flow in time-dependent dynamic networks, Unnamed Item, Note on combinatorial optimization with max-linear objective functions, Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic flows in regular matroids
• On a routing problem
• 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
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• A bad network problem for the simplex method and other minimum cost flow algorithms