Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Berstein et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: