Inverse polymatroidal flow problem

DOI10.1023/A:1009877408258zbMath0957.90126OpenAlexW1483686824MaRDI QIDQ1304389

Yanjun Li, Mao-cheng Cai, Xiao-guang 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)

Related Items (7)

Inverse optimization in high-speed networks ⋮ Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ Robust partial inverse network flow problems ⋮ The base-matroid and inverse combinatorial optimization problems. ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems

This page was built for publication: Inverse polymatroidal flow problem