An efficient labeling technique for solving sparse assignment problems

DOI10.1007/BF02240205zbMath0585.90060MaRDI QIDQ1071650

Ulrich Derigs, A. Metz

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

implementationcomputational experienceshortest augmenting pathsparse assignment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

A shortest augmenting path algorithm for dense and sparse linear assignment problems, Scaling and structural condition numbers, A new pivoting strategy for Gaussian elimination, Solution methods and computational investigations for the linear bottleneck assignment problem, An in-core/out-of-core method for solving large scale assignment problems

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Algorithm for the solution of the assignment problem for sparse matrices
• Signature Methods for the Assignment Problem
• Solving the Assignment Problem by Relaxation
• A Recursive Method for Solving Assignment Problems
• Recent Developments in Computer Implementation Technology for Network Flow Algorithms