680 search results - page 43 / 136 » Optimal spot-checking to minimize the computation time in vo... |
EOR
2007
14 years 9 months ago
2007
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...
SIAMJO
2010
14 years 4 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
MST
2010
14 years 4 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...