Cropped cubes
Jon Lee
J Combin Optim
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
J Combin Optim
Y. Berstein, Jon Lee, et al.
Mathematical Programming
Vijay S. Iyengar, Jon Lee, et al.
ACM Conference on Electronic Commerce 2001
Jon Lee, Janny Leung, et al.
Discrete Optimization