3475 search results - page 49 / 695 » Backbones in Optimization and Approximation |
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
AGI
2008
13 years 11 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
IOR
2007
13 years 10 months ago
2007
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
SIAMJO
2011
13 years 4 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...