519 search results - page 4 / 104 » A New Approach to Strongly Polynomial Linear Programming |
COR
2008
15 years 1 months ago
2008
115
click to vote
SAGT
2010
Springer
14 years 12 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
123
Voted
IJCAI
1989
15 years 2 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
111
click to vote
FOCS
1992
IEEE
15 years 5 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
102
click to vote
SIAMJO
2010
14 years 8 months ago
2010
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...