41 search results - page 4 / 9 » A Knapsack Secretary Problem with Applications |
70
Voted
DAM
2006
14 years 9 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
147
Voted
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
136
click to vote
FPGA
2006
ACM
15 years 1 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
63
Voted
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operatio...