نتایج جستجو برای: polynomial inequalities
تعداد نتایج: 141903 فیلتر نتایج به سال:
In many network applications, one searches for a connected subset of vertices that exhibits other desirable properties. To this end, this paper studies the connected subgraph polytope of a graph, which is the convex hull of subsets of vertices that induce a connected subgraph. Much of our work is devoted to the study of two nontrivial classes of valid inequalities. The first are the a, b-separa...
We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional α(K,x), already being used by Minkowski and contemporaries and having occurred in approximation theory in the work of Rivlin and Shapiro in the early sixties. We try to compare real, geometric ...
A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every ^-dimensional polyhedron admits a representation as the set of solutions of at most d(d + l) /2 polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any boun...
In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some quasi-polynomial-time and polynomial-time algorithms to solve the integer linear optimization problem defined on simplices minus all their integer vertices assuming that some mi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید