Convex Matroid Optimization
<|reference_start|>Convex Matroid Optimization: We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.<|reference_end|>
@article{onn2002convex,
    title={Convex Matroid Optimization},
    author={Shmuel Onn},
    journal={SIAM Journal on Discrete Mathematics, 17:249--253, 2003},
    year={2002},
    archivePrefix={arXiv},
    eprint={math/0207136},
    primaryClass={math.CO cs.DM math.OC math.RA}
}