400 search results - page 4 / 80 » Extended formulations in combinatorial optimization |
MP
2008
14 years 9 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
ORL
1998
14 years 9 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...