A note on an orthogonal systolic design for the assignment problem

DOI10.1016/S0167-8191(05)80154-1MaRDI QIDQ1179253zbMATH OpenOpenAlexFDO

Authors Sverre Storøy, Tor Sørevik

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(05)80154-1

zbMATH Keywords

Hungarian methodsystolic array

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• An orthogonal systolic design for the assignment problem
• A systolic array for the assignment problem
• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 515940

Cited in

(3)

• The partial orthogonalization process and its application to the optimal assignment problem
• A systolic array for the assignment problem
• An orthogonal systolic design for the assignment problem

This page was built for publication: A note on an orthogonal systolic design for the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179253)