15 citations · 23 across the 4 of their papers we have counts for
5 papers · 1 filter
Nonlinear optimization for matroid intersection and extensions
Yael Berstein, Jon Lee, Shmuel Onn +1
We address optimization of nonlinear functions of the form , where is a nonlinear function, is a matrix, and feasible are in some large fi…
Nonlinear Matroid Optimization and Experimental Design
Yael Berstein, Jon Lee, Hugo Maruri-Aguilar +4
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-crite…
Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz
J. A. De Loera, J. Lee, S. Margulies +1
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-co…
Nowhere-Zero Flow Polynomials
Shmuel Onn
In this article we introduce the flow polynomial of a digraph and use it to study nowhere-zero flows from a commutative algebraic perspective. Using Hilbert's Nullstellensatz, we e…
Convex Combinatorial Optimization
Shmuel Onn, Uriel G. Rothblum
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly pol…