Inverse problems of submodular functions on digraphs
type: Item
instance of: scholarly article
title: Inverse problems of submodular functions on digraphs
zbMATH Open document ID: 1034.90012
DOI: 10.1023/A:1004685508517
published in: Journal of Optimization Theory and Applications
publication date: 2001-08-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1486607
zbMATH Keywords: minimum cost circulation
zbMATH Keywords: strongly polynomial algorithms
author: Mao-Cheng Cai
author: Xiaoguang Yang
author: Yanjun Li
MaRDI profile type: Publication
cites work: On an instance of the inverse shortest paths problem
cites work: Inverse matroid intersection problem
cites work: Inverse polymatroidal flow problem
cites work: A strongly polynomial algorithm for the inverse shortest arborescence problem
cites work: An inverse problem of the weighted shortest path problem
cites work: Inverse maximum flow and minimum cut problems
cites work: Inverse problem of minimum cuts
cites work: Calculating some inverse linear programming problems
cites work: A further study on inverse linear programming problems
cites work: Q4716335
cites work: The inverse fractional matching problem
cites work: A network flow method for solving some inverse combinatorial optimization problems
cites work: Solution structure of some inverse combinatorial optimization problems
cites work: A column generation method for inverse shortest path problems
cites work: An algorithm for inverse minimum spanning tree problem
cites work: Q4149476
cites work: An Algorithm for Submodular Functions on Graphs
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Q3352816
cites work: Q3056948
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: Q3292914
cites work: Q3048571
cites work: The complexity analysis of the inverse center location problem
cites work: Inverse maximum capacity problems
cites work: Two general methods for inverse optimization problems
full work available at URL: a:1004685508517
OpenAlex ID: W8980110
description: scientific article; zbMATH DE number 1486607