Sciweavers

RSA
2011
85views more  RSA 2011»
13 years 5 months ago
Piercing random boxes
Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
Linh V. Tran
EOR
2008
69views more  EOR 2008»
13 years 11 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi