Robust partial inverse network flow problems

DOI10.1007/S11766-001-0026-YzbMath1098.90512OpenAlexW2325838670MaRDI QIDQ5943384

Xiao-guang 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)

Related Items (1)

Algorithms for the partial inverse matroid problem in which weights can only be increased

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• On an instance of the inverse shortest paths problem
• Inverse problem of minimum cuts
• Inverse polymatroidal flow problem
• Inverse problems of submodular functions on digraphs
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Inverse maximum flow and minimum cut problems
• An algorithm for inverse minimum spanning tree problem

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