Softassign versus Softmax: Benchmarks in Combinatorial Optimization.
Steven GoldAnand RangarajanPublished in: NIPS (1995)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- optimization problems
- combinatorial optimization problems
- branch and bound algorithm
- simulated annealing
- branch and bound
- mathematical programming
- combinatorial problems
- vehicle routing problem
- memetic algorithm
- benchmark suite
- evolutionary algorithm
- quadratic assignment problem
- exact algorithms
- activation function
- single machine scheduling problem
- classification rules
- path relinking
- hidden nodes
- combinatorial search
- neural network
- hard combinatorial optimization problems