Convex Matroid Optimization
Shmuel Onn · SIAM Journal on Discrete Mathematics · 2003
We consider a problem of maximizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally intractable, we show that it is efficiently solvable when a suitable parameter is restricted.