14 search results - page 1 / 3 » Integer Polynomial Optimization in Fixed Dimension |
MOR
2006
13 years 9 months ago
2006
FOCM
2007
13 years 9 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
DISOPT
2008
13 years 10 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
RTSS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...