Algorithm for the minimax assignment problem with a sparse rectangular matrix

zbMATH Open0625.90041MaRDI QIDQ580163FDOQ580163

Authors M. I. Rubinshtein 

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

sparse matricespolynomial algorithmminimax assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• A note on Hungarian algorithm for assignment problems
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• Remarks on implementation of O ( n ^1/2 τ) assignment algorithms
• scientific article; zbMATH DE number 176471
• scientific article; zbMATH DE number 3905737

Cited In (2)

• Solving a combinatorial problem with network flows
• Remarks on implementation of O ( n ^1/2 τ) assignment algorithms

This page was built for publication: Algorithm for the minimax assignment problem with a sparse rectangular matrix

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