Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits.
Carlo FilippiElisa StevanatoPublished in: Comput. Oper. Res. (2013)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- bi objective
- simulated annealing
- combinatorial optimization problems
- approximation schemes
- branch and bound
- metaheuristic
- ant colony optimization
- optimization problems
- branch and bound algorithm
- combinatorial problems
- efficient solutions
- quadratic assignment problem
- multi objective
- vehicle routing problem
- neural network
- optimal solution
- genetic algorithm