Pages that link to "Item:Q1838425"
From MaRDI portal
The following pages link to Algorithm for the solution of the assignment problem for sparse matrices (Q1838425):
Displaying 5 items.
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)