Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method.
Bogdán ZaválnijPublished in: LSSC (2015)
Keyphrases
- combinatorial optimization
- computational complexity
- combinatorial optimization problems
- branch and bound
- computational cost
- traveling salesman problem
- significant improvement
- simulated annealing
- optimization problems
- neural network
- computationally efficient
- quadratic assignment problem
- scheduling problem
- dynamic programming
- computer vision
- learning algorithm
- cost function
- objective function
- branch and bound algorithm
- mathematical programming
- parallel implementation
- heuristic methods
- exact algorithms