Combinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem.
Jacek BlazewiczMarta KasprzakPublished in: RAIRO Oper. Res. (2005)
Keyphrases
- combinatorial optimization
- mathematical programming
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- simulated annealing
- branch and bound
- dna sequencing
- optimization problems
- branch and bound algorithm
- combinatorial problems
- quadratic assignment problem
- vehicle routing problem
- dna sequences
- dna computing
- graph theory
- benchmark problems
- estimation of distribution algorithms
- submodular functions
- upper bound
- objective function
- memetic algorithm
- single machine
- ant colony optimization
- path relinking
- cost function
- evolutionary algorithm
- search space