Algorithms for flows with parametric capacities

DOI10.1007/BF01415514MaRDI QIDQ3823390zbMATH OpenOpenAlexFDO

Authors Horst W. Hamacher, Les R. Foulds

Publication date 1989

Published in 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

approximationconditional flow augmenting pathslabelingmaximal flowsparametric linear programvertical algorihm

Mathematics Subject Classification ID

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

Recommendations

• A Fast Parametric Maximum Flow Algorithm and Applications
• Parametric flows in static networks
• Parametric maximal flows in generalized networks – complexity and algorithms
• scientific article; zbMATH DE number 3876893
• A fast algorithm for the generalized parametric minimum cut problem and applications

Cites work

• A bad network problem for the simplex method and other minimum cost flow algorithms
• Algebraic flows in regular matroids
• 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
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 3634009 (Why is no real title available?)
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• On a routing problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(13)

• A parametric approach for maximum flow problems with an additional reverse convex constraint
• Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets
• Note on combinatorial optimization with max-linear objective functions
• Optimization of an SMD placement machine and flows in parametric networks
• An algorithm for computing Bingham flows
• Algorithmic Properties of Millstream Systems
• Parametric maximal flows in generalized networks – complexity and algorithms
• scientific article; zbMATH DE number 1522821 (Why is no real title available?)
• Minimum parametric flow in time-dependent dynamic networks
• A Fast Parametric Maximum Flow Algorithm and Applications
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• Parametric flows in static networks
• Algorithmic results for potential‐based flows: Easy and hard cases

This page was built for publication: Algorithms for flows with parametric capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823390)