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
Random sampling is a powerful tool for gathering information about a group by considering only a sma...
AbstractWe study the problem of optimizing nonlinear objective functions over bipartite matchings. W...
AbstractA framework for solving certain multi-dimensional parametric matroid optimization problems i...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We address optimization of nonlinear functions of the form f(Wx) , where f : Rd ! R is a nonlinear f...
We consider a problem of optimizing convex functionals over matroid bases. It is richly exp...
The need for fairness in machine learning algorithms is increasingly critical. A recent focus has be...
The need for fairness in machine learning algorithms is increasingly critical. A recent focus has be...
This paper reviews matroid optimization and algorithms including applications of matroid intersectio...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that ...
A matroid is a notion of independence in combi-natorial optimization which is closely related to com...
AbstractMatroid theory gives us powerful techniques for understanding combinatorial optimization pro...
Matroid theory gives us powerful techniques for understanding com-binatorial optimization problems a...
A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of it...
The robustness function of an optimization problem measures the maximum change in the value of its o...
Random sampling is a powerful tool for gathering information about a group by considering only a sma...
AbstractWe study the problem of optimizing nonlinear objective functions over bipartite matchings. W...
AbstractA framework for solving certain multi-dimensional parametric matroid optimization problems i...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We address optimization of nonlinear functions of the form f(Wx) , where f : Rd ! R is a nonlinear f...
We consider a problem of optimizing convex functionals over matroid bases. It is richly exp...
The need for fairness in machine learning algorithms is increasingly critical. A recent focus has be...
The need for fairness in machine learning algorithms is increasingly critical. A recent focus has be...
This paper reviews matroid optimization and algorithms including applications of matroid intersectio...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that ...
A matroid is a notion of independence in combi-natorial optimization which is closely related to com...
AbstractMatroid theory gives us powerful techniques for understanding combinatorial optimization pro...
Matroid theory gives us powerful techniques for understanding com-binatorial optimization problems a...
A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of it...
The robustness function of an optimization problem measures the maximum change in the value of its o...
Random sampling is a powerful tool for gathering information about a group by considering only a sma...
AbstractWe study the problem of optimizing nonlinear objective functions over bipartite matchings. W...
AbstractA framework for solving certain multi-dimensional parametric matroid optimization problems i...