41 search results - page 2 / 9 » A Knapsack Secretary Problem with Applications |
EOR
2006
13 years 6 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
WINE
2010
Springer
13 years 4 months ago
2010
Springer
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
DAM
2007
13 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...