A note on the parametric maximum flow problem and some related reoptimization issues

DOI10.1007/S10479-006-0155-ZMaRDI QIDQ2480211zbMATH OpenOpenAlexFDO

Authors Maria Grazia Scutellà

Publication date 31 March 2008

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0155-z

zbMATH Keywords

maximum flowparametric arc capacity

Mathematics Subject Classification ID

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
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Parametric maximal flows in generalized networks – complexity and algorithms
• Minimum cuts in parametric networks

Cites work

• A data structure for dynamic trees
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A Fast Parametric Maximum Flow Algorithm and Applications
• A new approach to the maximum-flow problem
• Complexity of some parametric integer and network programming problems
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• Generalization of a theorem on the parametric maximum flow problem
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Ordered optimal solutions and parametric minimum cut problems
• Self-adjusting binary search trees

Cited in

(19)

• A fast algorithm for the generalized parametric minimum cut problem and applications
• Parametric max flow problems in a class of networks with series-parallel structure
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• An approximation algorithm for a general class of parametric optimization problems
• An FPTAS for the knapsack problem with parametric weights
• Parametric analysis on cut-trees and its application on a protein clustering problem
• An FPTAS for the parametric knapsack problem
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Optimization of an SMD placement machine and flows in parametric networks
• Sensitive and parametric analysis of the maximum flow in a network
• Parametric maximal flows in generalized networks – complexity and algorithms
• A Fast Parametric Maximum Flow Algorithm and Applications
• Some recent contributions to network optimization
• Approximation schemes for the parametric knapsack problem
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
• Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
• Parametric matroid interdiction
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• Structural and algorithmic properties for parametric minimum cuts

This page was built for publication: A note on the parametric maximum flow problem and some related reoptimization issues

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