Pages that link to "Item:Q1071650"
From MaRDI portal
The following pages link to An efficient labeling technique for solving sparse assignment problems (Q1071650):
Displayed 5 items.
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Scaling and structural condition numbers (Q1368765) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- A new pivoting strategy for Gaussian elimination (Q1915612) (← links)
- An in-core/out-of-core method for solving large scale assignment problems (Q3763916) (← links)