Parallel Asynchronous Hungarian Methods for the Assignment Problem

DOI10.1287/IJOC.5.3.261zbMATH Open0789.90060OpenAlexW2015835398MaRDI QIDQ4282279FDOQ4282279

Authors: 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

Recommendations

• scientific article; zbMATH DE number 515940
• Randomized parallel algorithms for the multidimensional assignment problem
• Parallel algorithms for the assignment and minimum-cost flow problems
• scientific article; zbMATH DE number 724213
• A note on Hungarian algorithm for assignment problems
• ASYNPLEX, an asynchronous parallel revised simplex algorithm
• scientific article; zbMATH DE number 934535
• Parallel algorithms for solution of problems in scheduling theory

zbMATH Keywords

assignmentHungarian methodparallel asynchronous implementation

Mathematics Subject Classification ID

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

Cited In (7)

• Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
• Towards auction algorithms for large dense assignment problems
• Title not available (Why is that?)
• Improving the Hungarian assignment algorithm
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
• Title not available (Why is that?)
• 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

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