Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
Moshe DrorJames B. OrlinPublished in: SIAM J. Discret. Math. (2008)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- small number
- definite clause
- combinatorial optimization problems
- multiscale
- simulated annealing
- upper bound
- optimization problems
- metaheuristic
- document collections
- hard combinatorial optimization problems
- combinatorial problems
- branch and bound algorithm
- branch and bound
- neural network
- constraint satisfaction problems
- particle swarm optimization
- genetic algorithm