Pages that link to "Item:Q2181789"
From MaRDI portal
The following pages link to Maximum diversity problem with squared Euclidean distance (Q2181789):
Displaying 5 items.
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- Maximizing single attribute diversity in group selection (Q2678607) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)