Computation in multicriteria matroid optimization
Journal of Experimental Algorithmics (JEA)
Discrete Optimization
Hi-index | 0.00 |
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.