"Optimal" neural representation of higher order for quadratic combinatorial optimization.
Satoshi MatsudaPublished in: IJCNN (1999)
Keyphrases
- combinatorial optimization
- higher order
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- pairwise
- branch and bound
- simulated annealing
- optimal solution
- combinatorial problems
- branch and bound algorithm
- optimization problems
- mathematical programming
- hard combinatorial optimization problems
- high order
- dynamic programming
- natural images
- network architecture
- memetic algorithm
- quadratic assignment problem
- anti unification
- worst case
- markov random field
- graph theory
- objective function
- single machine scheduling problem
- path relinking
- particle swarm optimization