A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits.
Carlo FilippiElisa StevanatoPublished in: Algorithmic Oper. Res. (2012)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- metaheuristic
- branch and bound
- simulated annealing
- optimization problems
- combinatorial problems
- computationally efficient
- energy function
- branch and bound algorithm
- computational efficiency
- semi definite programming
- path relinking
- vehicle routing problem
- objective function
- dynamic programming
- cost function
- search space
- computational complexity