Inverse problems of submodular functions on digraphs (Q1573989): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mao-cheng Cai / rank
 
Normal rank
Property / author
 
Property / author: Xiao-guang Yang / rank
 
Normal rank
Property / author
 
Property / author: Yanjun Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse matroid intersection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse polymatroidal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for the inverse shortest arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse problem of the weighted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum flow and minimum cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problem of minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating some inverse linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further study on inverse linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse fractional matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow method for solving some inverse combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution structure of some inverse combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation method for inverse shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for inverse minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Submodular Functions on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum capacity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two general methods for inverse optimization problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1004685508517 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W8980110 / rank
 
Normal rank

Latest revision as of 09:41, 30 July 2024

scientific article
Language Label Description Also known as
English
Inverse problems of submodular functions on digraphs
scientific article

    Statements

    Inverse problems of submodular functions on digraphs (English)
    0 references
    27 August 2001
    0 references
    minimum cost circulation
    0 references
    strongly polynomial algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers