Algorithm for the solution of the assignment problem for sparse matrices
From MaRDI portal
Publication:1838425
DOI10.1007/BF02247938zbMath0508.90061MaRDI QIDQ1838425
Publication date: 1983
Published in: Computing (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
An efficient labeling technique for solving sparse assignment problems, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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