New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The auction algorithm: A distributed relaxation method for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual coordinate step methods for linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The auction algorithm for the transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / 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: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric shortest path algorithms with an application to cyclic staffing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / 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: A linear time randomizing algorithm for searching ranked functions / rank
 
Normal rank

Latest revision as of 10:47, 16 May 2024

scientific article
Language Label Description Also known as
English
New scaling algorithms for the assignment and minimum mean cycle problems
scientific article

    Statements

    New scaling algorithms for the assignment and minimum mean cycle problems (English)
    0 references
    0 references
    0 references
    26 September 1992
    0 references
    bipartite matching
    0 references
    scaling algorithms
    0 references
    assignment
    0 references
    auction algorithm
    0 references
    successive shortest path algorithm
    0 references
    mean cost of a cycle
    0 references
    minimum mean cycle problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references