Leo Liberti, Benoît Masson, et al.
Discrete Applied Mathematics
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.
Leo Liberti, Benoît Masson, et al.
Discrete Applied Mathematics
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Jon Lee, Vahab S. Mirrokni, et al.
STOC 2009
Vijay S. Iyengar, Jon Lee, et al.
ACM Conference on Electronic Commerce 2001