Generalization of a theorem on the parametric maximum flow problem

DOI10.1016/0166-218X(93)90245-JzbMath0780.90029OpenAlexW2033822499MaRDI QIDQ1208465

Shuichi Ueno, Yoji Kajitani, Tadashi Arai

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90245-j

zbMATH Keywords

directed graphnestingminimum cutsparametric maximum flowparametric network

Mathematics Subject Classification ID

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

Related Items (8)

An approximation algorithm for a general class of parametric optimization problems ⋮ Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint ⋮ Parametric matroid interdiction ⋮ Approximation schemes for the parametric knapsack problem ⋮ A note on the parametric maximum flow problem and some related reoptimization issues ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Unnamed Item ⋮ Ordered optimal solutions and parametric minimum cut problems

Cites Work

• Unnamed Item
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• A comparison of phase and nonphase network flow algorithms
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Critical Load Factors in Two-Processor Distributed Systems
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Generalization of a theorem on the parametric maximum flow problem