Robust partial inverse network flow problems

DOI10.1007/S11766-001-0026-YMaRDI QIDQ5943384zbMATH OpenOpenAlexFDO

Authors Xiaoguang Yang

Publication date 2001

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-001-0026-y

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• A network flow method for solving some inverse combinatorial optimization problems
• Combinatorial algorithms for inverse network flow problems
• Inverse feasibility problems of the inverse maximum flow problems
• Complexity of partial inverse assignment problem and partial inverse cut problem
• Inverse maximum flow and minimum cut problems

Cites work

• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A strongly polynomial minimum cost circulation algorithm
• An algorithm for inverse minimum spanning tree problem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Inverse maximum flow and minimum cut problems
• Inverse polymatroidal flow problem
• Inverse problem of minimum cuts
• Inverse problems of submodular functions on digraphs
• Network flows. Theory, algorithms, and applications.
• On an instance of the inverse shortest paths problem

Cited in

(2)

• Complexity of partial inverse assignment problem and partial inverse cut problem
• Algorithms for the partial inverse matroid problem in which weights can only be increased

This page was built for publication: Robust partial inverse network flow problems

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