A combinatorial optimization approach to the Denavit-Hartenberg parameter assignment.
Akos CsiszarPublished in: AIM (2015)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- branch and bound
- branch and bound algorithm
- mathematical programming
- combinatorial problems
- optimization problems
- graph theory
- memetic algorithm
- exact algorithms
- vehicle routing problem
- quadratic assignment problem
- hard combinatorial optimization problems
- path relinking
- combinatorial search
- lower bound
- max flow min cut
- estimation of distribution algorithms
- parameter values
- cost function