A parallel shortest augmenting path algorithm for the assignment problem (Q4302861): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/115234.115349 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2013280707 / rank | |||
Normal rank |
Latest revision as of 00:50, 20 March 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
21 August 1994
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