The inverse maximum dynamic flow problem

DOI10.1007/S11425-010-3129-1zbMath1209.90334OpenAlexW2074380092MaRDI QIDQ625882

Mehri 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

network flowsinverse optimizationdynamic network flows

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• Efficient continuous-time dynamic network flow algorithms
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Inverse maximum flow problems under the weighted Hamming distance
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• The inverse maximum flow problem consideringl_∞norm
• Inverse Optimization
• Inverse maximum flow and minimum cut problems
• Combinatorial algorithms for inverse network flow problems
• Inverse Bottleneck Optimization Problems on Networks

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