Open Combinatorial Problems in Computational Molecular Biology.
Pavel A. PevznerMichael S. WatermanPublished in: ISTCS (1995)
Keyphrases
- combinatorial problems
- computational molecular biology
- international conference
- constraint programming
- metaheuristic
- traveling salesman problem
- constraint satisfaction problems
- combinatorial optimization
- phase transition
- constraint satisfaction
- graph coloring
- solving hard
- branch and bound algorithm
- graph colouring
- hard combinatorial optimization problems
- global constraints
- combinatorial search
- tabu search
- simulated annealing
- scheduling problem
- np hard
- multi objective
- reinforcement learning