Convex Matroid Optimization

  title={Convex Matroid Optimization},
  author={Shmuel Onn},
  journal={SIAM J. Discrete Math.},
  • Shmuel Onn
  • Published 2003 in SIAM J. Discrete Math.
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. 

From This Paper

Topics from this paper.
10 Citations
7 References
Similar Papers


Publications referenced by this paper.
Showing 1-7 of 7 references

Momentopes and the vertex complexity of partition polytopes

  • S. Aviran, S. Onn
  • Discrete and Computational Geometry, 27:409–417
  • 2002
1 Excerpt

Maximizing the product of two linear functions in 0 − 1 variables

  • L. P. Hammer, P. Hansen, P. M. Pardalos, D. J. Rader
  • RUTCOR Research Report, Rutgers University
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…