Pages that link to "Item:Q1365535"
From MaRDI portal
The following pages link to Massively parallel augmenting path algorithms for the assignment problem (Q1365535):
Displaying 7 items.
- Algorithms for assignment problems on an array processor (Q1124328) (← links)
- Implementing (nondeterministic) parallel assignments (Q1352008) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (Q3991331) (← links)
- A parallel shortest augmenting path algorithm for the assignment problem (Q4302861) (← links)