Matroid matching: The power of local search
Jon Lee, Maxim Sviridenko, et al.
STOC 2010
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multicriteria optimization. We provide a combinatorial polynomial time algorithm for arbitrary oracle-presented matroids, that makes repeated use of matroid intersection and an algebraic algorithm for vectorial matroids. Our work is partly motivated by applications to minimum-aberration model-fitting in experimental design in statistics, which we discuss and demonstrate in detail. © 2008 Society for Industrial and Applied Mathematics.
Jon Lee, Maxim Sviridenko, et al.
STOC 2010
Jesús A. De Loera, Jon Lee, et al.
ISSAC 2008
Jon Lee, Janny Leung, et al.
Discrete Optimization
Brenda L. Dietrich, Jon Lee, et al.
Annals of Operations Research