Pages that link to "Item:Q2991031"
From MaRDI portal
The following pages link to A note on Hungarian algorithm for assignment problems (Q2991031):
Displaying 8 items.
- Algorithm for the minimax assignment problem with a sparse rectangular matrix (Q580163) (← links)
- A note of reduced dimension optimization algorithm of assignment problem (Q887868) (← links)
- Classes of matrices associated with the optimal assignment problem (Q1081608) (← links)
- Revisiting the 0,1 assignment problem (Q1183142) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- The partial orthogonalization process and its application to the optimal assignment problem (Q2706804) (← links)
- (Q3626421) (← links)
- Parallel Asynchronous Hungarian Methods for the Assignment Problem (Q4282279) (← links)