Inverse problems of submodular functions on digraphs
From MaRDI portal
Publication:1573989
DOI10.1023/A:1004685508517zbMath1034.90012OpenAlexW8980110MaRDI QIDQ1573989
Yanjun Li, Xiao-guang Yang, Mao-cheng Cai
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ Robust partial inverse network flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A further study on inverse linear programming problems
- Inverse polymatroidal flow problem
- Solution structure of some inverse combinatorial optimization problems
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- Inverse maximum capacity problems
- Two general methods for inverse optimization problems
- The complexity analysis of the inverse center location problem
- An inverse problem of the weighted shortest path problem
- Calculating some inverse linear programming problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- The inverse fractional matching problem
- Inverse maximum flow and minimum cut problems
- An algorithm for inverse minimum spanning tree problem
- An Algorithm for Submodular Functions on Graphs
- A column generation method for inverse shortest path problems
- A network flow method for solving some inverse combinatorial optimization problems
