A solution to the inverse minimum cut problem in dynamic network flows

DOI10.17654/AS049040267MaRDI QIDQ2967695zbMATH OpenFDO

Authors Hajar Banikhademi, Hasan Salehi Fathabadi

Publication date 1 March 2017

Published in Advances and Applications in Statistics (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/10225.htm

zbMATH Keywords

dynamic network flowinverse optimizationminimum dynamic cuttime-expanded network

Mathematics Subject Classification ID

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

Recommendations

• The inverse maximum dynamic flow problem
• Inverse maximum flow and minimum cut problems
• Inverse problem of minimum cuts
• Combinatorial algorithms for inverse network flow problems
• Inverse maximum flow problem in planar networks

Cited in

(4)

• Discussion on the inverse dynamic minimum cost path problem under \(L_1\) norm
• Inverse maximum flow and minimum cut problems
• Canceling most helpful total cuts for minimum cost network flow
• The inverse maximum dynamic flow problem

This page was built for publication: A solution to the inverse minimum cut problem in dynamic network flows

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