Molecular solutions for double and partial digest problems in polynomial time.
Mohammad GanjtabeshHaydeh AhrabianAbbas Nowzari-DaliniPublished in: Comput. Informatics (2009)
Keyphrases
- benchmark problems
- similar problems
- combinatorial problems
- approximate solutions
- specific problems
- problems involving
- combinatorial optimization
- np complete
- optimization problems
- approximation algorithms
- data sets
- partial solutions
- computational complexity
- computational issues
- approximation schemes
- practical solutions
- suboptimal solutions
- efficient solutions
- solving problems
- exact solution
- search methods
- decision problems
- lower bound