The inverse maximum dynamic flow problem

DOI10.1007/S11425-010-3129-1MaRDI QIDQ625882zbMATH OpenOpenAlexFDO

Authors M. Bagherian

Publication date 25 February 2011

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-010-3129-1

zbMATH Keywords

dynamic network flowsinverse optimizationnetwork flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Inverse maximum flow and minimum cut problems
• A solution to the inverse minimum cut problem in dynamic network flows
• Inverse minimum flow problem
• Inverse maximum flow problem in planar networks
• The inverse maximum flow problem consideringl_∞norm

Cites work

• A suggested computation for maximal multi-commodity network flows
• Combinatorial algorithms for inverse network flow problems
• Efficient continuous-time dynamic network flow algorithms
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 46855 (Why is no real title available?)
• Inverse Bottleneck Optimization Problems on Networks
• Inverse maximum flow and minimum cut problems
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse Optimization
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• The inverse maximum flow problem consideringl_∞norm

Cited in

(7)

• Inverse maximum capacity problems
• Capacity inverse minimum cost flow problem
• Inverse feasibility problems of the inverse maximum flow problems
• A solution to the inverse minimum cut problem in dynamic network flows
• The inverse maximum flow problem consideringl_∞norm
• Inverse maximum flow and minimum cut problems
• The Maximum Flow Problem for Oriented Flows

This page was built for publication: The inverse maximum dynamic flow problem

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