Generalization of a theorem on the parametric maximum flow problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A comparison of phase and nonphase network flow algorithms
- Critical Load Factors in Two-Processor Distributed Systems
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
Cited in
(14)- Structural and algorithmic properties for parametric minimum cuts
- Monge and feasibility sequences in general flow problems
- Generalized Maximum Flows over Time
- A note on the parametric maximum flow problem and some related reoptimization issues
- A measure-theoretical max-flow problem
- Optimization of an SMD placement machine and flows in parametric networks
- scientific article; zbMATH DE number 5585920 (Why is no real title available?)
- Parametric max flow problems in a class of networks with series-parallel structure
- Ordered optimal solutions and parametric minimum cut problems
- An approximation algorithm for a general class of parametric optimization problems
- Approximation schemes for the parametric knapsack problem
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- Parametric matroid interdiction
This page was built for publication: Generalization of a theorem on the parametric maximum flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208465)
