Minimum-cost flows in unit-capacity networks (Q1693987): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding minimum-cost flows by double scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Price Updates Help / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational behavior of a polynomial-time network flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buckets, Heaps, Lists, and Monotone Priority Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank

Latest revision as of 01:54, 15 July 2024

scientific article
Language Label Description Also known as
English
Minimum-cost flows in unit-capacity networks
scientific article

    Statements

    Minimum-cost flows in unit-capacity networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    minimum-cost flows
    0 references
    bipartite matching
    0 references
    assignment problem
    0 references
    0 references