On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms.
Catherine RoucairolPublished in: Parallel Processing of Discrete Optimization Problems (1994)
Keyphrases
- data structure
- times faster
- computational cost
- worst case
- significant improvement
- learning algorithm
- theoretical analysis
- suffix tree
- optimization problems
- evolutionary algorithm
- computationally efficient
- simulated annealing
- benchmark datasets
- orders of magnitude
- np hard
- combinatorial optimization
- error bounds
- convergence rate
- randomized algorithm
- worst case analysis