A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

1996 ◽  
Vol 6 (3) ◽  
pp. 251-272 ◽  
Author(s):  
Olof Damberg ◽  
Sverre Storøy ◽  
Tor Sørevik
Keyword(s):  
Assignment Problem ◽  
Data Parallel ◽  
Augmenting Path

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

1989 ◽  
Author(s):  
Egon Balas ◽  
Donald Miller ◽  
Joseph Pekny ◽  
Paolo Toth
Keyword(s):  
Assignment Problem ◽  
Augmenting Path

A parallel shortest augmenting path algorithm for the assignment problem

1991 ◽  
Vol 38 (4) ◽  
pp. 985-1004 ◽  
Author(s):  
Egon Balas ◽  
Donald Miller ◽  
Joseph Pekny ◽  
Paolo Toth
Keyword(s):  
Assignment Problem ◽  
Augmenting Path

Massively parallel augmenting path algorithms for the assignment problem

Computing ◽  
1997 ◽  
Vol 59 (1) ◽  
pp. 1-16 ◽  
Author(s):  
S. Storøy ◽  
T. Sørevik
Keyword(s):  
Assignment Problem ◽  
Massively Parallel ◽  
Augmenting Path

A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem

1992 ◽  
Vol 40 (1) ◽  
pp. 178-187 ◽  
Author(s):  
J. Kennington ◽  
Z. Wang
Keyword(s):  
Assignment Problem ◽  
Augmenting Path

Data-parallel line relaxation method for the Navier-Stokes equations

AIAA Journal ◽  
1998 ◽  
Vol 36 ◽  
pp. 1603-1609 ◽  
Author(s):  
Michael J. Wright ◽  
Graham V. Candler ◽  
Deepak Bose
Keyword(s):  
Stokes Equations ◽  
Relaxation Method ◽  
Parallel Line ◽  
Navier Stokes ◽  
Navier Stokes Equations ◽  
Data Parallel
Sign in / Sign up

Export Citation Format

Share Document