Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Shmuel Onn (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: