Algorithm for the solution of the assignment problem for sparse matrices

DOI10.1007/BF02247938zbMath0508.90061MaRDI QIDQ1838425

Paolo Toth, Giorgio Carpaneto

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

sparse matricescomputational resultsassignment problemefficient algorithmFORTRAN program

Mathematics Subject Classification ID

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

Related Items

Improving the Hungarian assignment algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Primal-dual algorithms for the assignment problem, Solution methods and computational investigations for the linear bottleneck assignment problem, An efficient labeling technique for solving sparse assignment problems

Uses Software

• Algorithm 548

Cites Work

• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• The alternating basis algorithm for assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item