论文信息 - Convex Matroid Optimization

Convex Matroid Optimization

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.

Shmuel Onn | S. Onn

[1] Leonard J. Schulman,et al. The Vector Partition Problem for Convex Objective Functions , 2001, Math. Oper. Res..

[2] Erich Steiner,et al. A polynomial case of unconstrained zero-one quadratic optimization , 2001, Math. Program..

[3] Micha Sharir,et al. On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[4] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.

[5] E. Harding. The number of partitions of a set of N points in k dimensions induced by hyperplanes , 1967, Proceedings of the Edinburgh Mathematical Society.

[6] Uriel G. Rothblum,et al. A Polynomial Time Algorithm for Shaped Partition Problems , 1999, SIAM J. Optim..

[7] Noga Alon,et al. Separable Partitions , 1999, Discret. Appl. Math..

[8] David J. Rader,et al. Maximizing the Product of Two Linear Functions In 0-1 Variables , 2002 .

[9] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..