12 search results - page 1 / 3 » Threshold arrangements and the knapsack problem |
APPML
2006
13 years 4 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
COCOA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
WWW
2008
ACM
14 years 5 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 ...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
CEC
2008
IEEE
13 years 10 months ago
2008
IEEE
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...