Convex Matroid Optimization

DOI10.1137/S0895480102408559zbMath1056.90121arXivmath/0207136MaRDI QIDQ4443135

Shmuel Onn

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0207136

zbMATH Keywords

clusteroptimizationpartitioncombinatorial optimizationgreedy algorithmpolytopequadratic assignmentconvexmatroidpolynomial timestrongly polynomial time

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (7)

Parametric nonlinear discrete optimization over well-described sets and matroid intersections ⋮ Matroid optimisation problems with nested non-linear monomials in the objective function ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Nonlinear bipartite matching ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ Matroid optimization problems with monotone monomials in the objective

This page was built for publication: Convex Matroid Optimization