Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.
Thomas ChristofGerhard ReineltPublished in: Algorithmica (2001)
Keyphrases
- algorithmic aspects
- lower bound
- shared memory
- parallel processing
- small number
- general purpose
- databases
- computer architecture
- massively parallel
- data mining
- multi core processors
- parallel execution
- depth first search
- convex relaxation
- neural network
- video sequences
- linear programming
- image sequences
- data sets
- upper bound
- dynamic programming
- bayesian networks
- search algorithm