Pages that link to "Item:Q4845077"
From MaRDI portal
The following pages link to Geometric algorithms for the minimum cost assignment problem (Q4845077):
Displaying 5 items.
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)