Local Search, Reducibility and Approximability of NP-Optimization Problems.
Giorgio AusielloMarco ProtasiPublished in: Inf. Process. Lett. (1995)
Keyphrases
- optimization problems
- combinatorial optimization
- evolutionary algorithm
- metaheuristic
- tabu search
- search algorithm
- cost function
- candidate solutions
- simulated annealing
- np hard
- traveling salesman problem
- approximation algorithms
- global search
- search space
- objective function
- knapsack problem
- evolutionary search
- np complete
- memetic algorithm
- computational complexity
- genetic algorithm
- optimal solution
- optimization methods
- job shop scheduling problem
- search procedures
- search procedure
- optimization criteria
- benchmark problems
- differential evolution
- special case
- hooke jeeves
- multi start
- systematic search
- database
- solving global optimization problems
- search heuristics
- initial solution
- search methods
- genetic programming
- case study
- data sets