1547 search results - page 1 / 310 » Solving Knapsack Problems in a Sticker Based Model |
93
Voted
DNA
2001
Springer
15 years 3 months ago
2001
Springer
72
Voted
JCB
1998
14 years 10 months ago
1998
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
77
Voted
CP
2003
Springer
15 years 4 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
83
Voted
AAAI
2004
15 years 8 days ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
93
Voted
PDPTA
1996
15 years 5 days ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...