Parallel Asynchronous Hungarian Methods for the Assignment Problem

DOI10.1287/ijoc.5.3.261zbMath0789.90060OpenAlexW2015835398MaRDI QIDQ4282279

Dimitri P. Bertsekas, David A. Castanon

Publication date: 24 March 1994

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/3220

zbMATH Keywords

assignmentHungarian methodparallel asynchronous implementation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (4)

Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment ⋮ Towards auction algorithms for large dense assignment problems ⋮ A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique ⋮ A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

This page was built for publication: Parallel Asynchronous Hungarian Methods for the Assignment Problem