Review of Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics by Juraj Hromkovic. Springer 2001.
Hassan MasumPublished in: SIGACT News (2003)
Keyphrases
- combinatorial optimization
- hard problems
- hyper heuristics
- metaheuristic
- simulated annealing
- combinatorial optimization problems
- traveling salesman problem
- optimization problems
- phase transition
- evolutionary algorithm
- mathematical programming
- branch and bound algorithm
- branch and bound
- combinatorial problems
- memetic algorithm
- exact algorithms
- submodular functions
- computer science
- quadratic assignment problem
- vehicle routing problem
- hard combinatorial optimization problems
- ant colony optimization
- random instances
- genetic programming
- genetic algorithm
- lower bound
- heuristic search
- tabu search
- constraint satisfaction problems
- search space
- heuristic methods
- search heuristics
- path relinking
- search methods
- timetabling problem
- approximation algorithms
- search strategies
- constraint satisfaction
- np complete
- particle swarm optimization
- search algorithm