Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP).
Jaroslav NesetrilDaniel TurzíkPublished in: SOFSEM (1997)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- traveling salesman problem
- max cut
- ant colony optimization
- np complete problems
- optimization problems
- continuous optimization problems
- metaheuristic
- combinatorial problems
- graph coloring
- simulated annealing
- branch and bound
- job shop scheduling
- branch and bound algorithm
- knapsack problem
- job shop scheduling problem
- graph model
- np hard
- vehicle routing problem
- np complete
- aco algorithms
- evolutionary algorithm
- genetic algorithm
- neural network
- tabu search
- optimal solution
- objective function