From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization.
Raffaele GiancarloAntonio RestivoMarinella SciortinoPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- branch and bound
- mathematical programming
- metaheuristic
- branch and bound algorithm
- quadratic assignment problem
- combinatorial problems
- hard combinatorial optimization problems
- optimization problems
- memetic algorithm
- exact algorithms
- graph theory
- genetic algorithm
- evolutionary algorithm
- combinatorial search
- vehicle routing problem
- path relinking
- cost function
- computational complexity