A parallel shortest augmenting path algorithm for the assignment problem (Q4302861): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:35, 6 February 2024

scientific article; zbMATH DE number 622341
Language Label Description Also known as
English
A parallel shortest augmenting path algorithm for the assignment problem
scientific article; zbMATH DE number 622341

    Statements

    A parallel shortest augmenting path algorithm for the assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel processors
    0 references
    computation on matrices
    0 references
    parallel algorithms
    0 references
    sparse and very large systems
    0 references
    linear programming
    0 references
    combinatorial algorithms
    0 references
    shortest augmenting path algorithm
    0 references
    assignment problem
    0 references