427 search results - page 53 / 86 » A Subexponential Bound for Linear Programming |
4OR
2010
13 years 7 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
AI
1999
Springer
13 years 8 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
SARA
2009
Springer
14 years 3 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...