206 search results - page 2 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
109
click to vote
SSWMC
2004
15 years 4 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
125
Voted
ANOR
2010
15 years 3 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
128
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
140
click to vote
MP
2002
15 years 3 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
76
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer