3250 search results - page 121 / 650 » An Algorithm to Solve a Linear Program |
118
click to vote
AAAI
2011
14 years 2 months ago
2011
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
121
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
107
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
113
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
141
Voted
IPCO
2010
15 years 16 days ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...