1040 search results - page 95 / 208 » Rounding algorithms for covering problems |
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
FEGC
2006
14 years 11 months ago
2006
CiteSeer and Google-Scholar are huge digital libraries which provide access to (computer-)science publications. Both collections are operated like specialized search engines, they ...
102
click to vote
AOR
2010
14 years 7 months ago
2010
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
109
click to vote
SIAMCOMP
2012
13 years 8 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
105
click to vote
SODA
1992
ACM
14 years 11 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...