Inverse problems of submodular functions on digraphs

DOI10.1023/A:1004685508517MaRDI QIDQ1573989zbMATH OpenOpenAlexFDO

Authors Mao-Cheng Cai, Xiaoguang Yang, Yanjun Li

Publication date 27 August 2001

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

strongly polynomial algorithmsminimum cost circulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Note on inverse problem with \(l_\infty\) objective function
• Inverse polymatroidal flow problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse feasibility problems of the inverse maximum flow problems

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 949659 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A column generation method for inverse shortest path problems
• A further study on inverse linear programming problems
• A network flow method for solving some inverse combinatorial optimization problems
• A strongly polynomial algorithm for the inverse shortest arborescence problem
• A strongly polynomial minimum cost circulation algorithm
• An Algorithm for Submodular Functions on Graphs
• An algorithm for inverse minimum spanning tree problem
• An inverse problem of the weighted shortest path problem
• Calculating some inverse linear programming problems
• Inverse matroid intersection problem
• Inverse maximum capacity problems
• Inverse maximum flow and minimum cut problems
• Inverse polymatroidal flow problem
• Inverse problem of minimum cuts
• Network flows. Theory, algorithms, and applications.
• On an instance of the inverse shortest paths problem
• Solution structure of some inverse combinatorial optimization problems
• The complexity analysis of the inverse center location problem
• The inverse fractional matching problem
• Two general methods for inverse optimization problems

Cited in

(3)

• Robust partial inverse network flow problems
• On the graph condition regarding the \(F\)-inverse cover problem
• Complexity of partial inverse assignment problem and partial inverse cut problem

This page was built for publication: Inverse problems of submodular functions on digraphs

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