Inverse polymatroidal flow problem

DOI10.1023/A:1009877408258MaRDI QIDQ1304389zbMATH OpenOpenAlexFDO

Authors Yanjun Li, Mao-Cheng Cai, Xiaoguang Yang

Publication date 22 September 1999

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009877408258

zbMATH Keywords

inverse problemminimum cost circulationcombinatorial strongly polynomial algorithmpolymatroidal flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Inverse problems of submodular functions on digraphs
• Polymatroidal flow network models with multiple sinks
• Combinatorial algorithms for inverse network flow problems
• Capacity inverse minimum cost flow problem

Cited in

(11)

• scientific article; zbMATH DE number 4075083 (Why is no real title available?)
• Some reverse location problems
• Robust partial inverse network flow problems
• Polymatroidal flows with lower bounds
• The base-matroid and inverse combinatorial optimization problems.
• Inverse problems of matroid intersection
• Approximation hierarchies for the cone of flow matrices
• Inverse problems of submodular functions on digraphs
• Inverse optimization in high-speed networks
• Note on inverse problem with \(l_\infty\) objective function
• Complexity of partial inverse assignment problem and partial inverse cut problem

This page was built for publication: Inverse polymatroidal flow problem

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