Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer.
Hassan TaghipourMahdi RezaeiHeydar Ali EsmailiPublished in: Adv. Bioinformatics (2013)
Keyphrases
- knapsack problem
- implicit enumeration
- randomly generated test instances
- dna computing
- combinatorial optimization problems
- optimal solution
- linear relaxation
- test problems
- exact algorithms
- dynamic programming
- optimization problems
- greedy algorithm
- multidimensional knapsack problem
- lp relaxation
- integer variables
- bicriteria
- np hard
- dna sequences
- cutting plane
- multiple objectives
- continuous relaxation
- combinatorial optimization
- evolutionary algorithm
- search algorithm
- greedy heuristic
- decision variables
- maximum profit