21 search results - page 4 / 5 » Covering Number Bounds of Certain Regularized Linear Functio... |
STOC
2004
ACM
14 years 6 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
SPAA
2005
ACM
13 years 12 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
CPAIOR
2005
Springer
13 years 12 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
SIAMJO
2002
13 years 6 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...