Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
Faisal N. Abu-KhzamMichael A. LangstonPushkar ShanbhagPublished in: Parallel and Distributed Computing and Networks (2004)
Keyphrases
- parallel algorithm
- combinatorial problems
- combinatorial optimization
- constraint programming
- combinatorial search problems
- constraint satisfaction problems
- combinatorial search
- traveling salesman problem
- solving hard
- metaheuristic
- graph coloring
- constraint satisfaction
- optimization problems
- parallel computation
- maximum satisfiability
- phase transition
- cluster of workstations
- branch and bound algorithm
- shared memory
- parallel programming
- discovery of association rules
- parallel implementations
- constraint propagation
- global constraints
- pc cluster
- parallel version
- integer programming
- boolean satisfiability
- neural network
- branch and bound
- peer to peer
- np hard
- multi objective
- evolutionary algorithm
- lower bound
- objective function