Combinatorial optimization with interaction costs: Complexity and solvable cases.
Stefan LendlAnte CusticAbraham P. PunnenPublished in: Discret. Optim. (2019)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- combinatorial optimization problems
- branch and bound
- simulated annealing
- computational complexity
- mathematical programming
- branch and bound algorithm
- combinatorial problems
- np complete
- quadratic assignment problem
- graph theory
- np hard
- special case
- worst case
- optimization problems
- hard combinatorial optimization problems
- max flow min cut
- case base
- vehicle routing problem
- total cost
- user interaction
- path relinking
- human computer interaction
- single machine scheduling problem
- multi objective
- lower bound
- genetic algorithm
- memetic algorithm