On Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An Introduction.
Franc BrglezPublished in: CoRR (2013)
Keyphrases
- combinatorial optimization
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- multi dimensional
- combinatorial problems
- branch and bound
- optimization problems
- mathematical programming
- branch and bound algorithm
- quadratic assignment problem
- graph theory
- combinatorial search
- vehicle routing problem
- neural network
- hard combinatorial optimization problems
- exact algorithms
- memetic algorithm
- optimal solution