Matroid Optimization and Experimental Design ∗
نویسندگان
چکیده
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.
منابع مشابه
Nonlinear Matroid Optimization and Experimental Design
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 multi-criteria 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 w...
متن کاملResilient Non-Submodular Maximization over Matroid Constraints
Applications in control, robotics, and optimizationmotivate the design of systems by selecting system elements,such as actuators, sensors, or data, subject to complex designconstraints that require the system elements not only to bea few in number, but also, to satisfy heterogeneity or global-interdependency constraints; in particular, matroid constraints.However, in fai...
متن کاملThe k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs. We solve the problems for undirected and directed graphs. We then use these exact algorithms to give improved approximation algorithms for problems in which the weights satisfy the triangle inequality and the connect...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms and Matroid Optimization Problems
We analyze the performan e of evolutionary algorithms on various matroid optimization problems that en ompass a vast number of e iently solvable as well as NP-hard ombinatorial optimization problems (in luding many well-known examples su h as minimum spanning tree and maximum bipartite mat hing). We obtain very promising bounds on the expe ted running time and quality of the omputed solution. O...
متن کاملThe Base-matroid and Inverse Combinatorial Optimization Problems
A new matroid is introduced: this matroid is de0ned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the 0eld of inverse combinatorial optimization problems. We discuss in detail the LP fo...
متن کامل