A Parallel Nonlinear Integer Programming Algorithm Based on Branch and Bound and Simulated Annealing.
Ken W. BosworthGardiner S. StilesRick PenningtonPublished in: PPSC (1987)
Keyphrases
- simulated annealing
- branch and bound
- optimal solution
- combinatorial optimization
- lower bound
- np hard
- depth first search
- search space
- column generation
- optimization method
- worst case
- dynamic programming
- computational complexity
- tree search algorithm
- hybrid algorithm
- neural network
- branch and bound algorithm
- linear programming
- artificial neural networks
- beam search
- tree decomposition
- hill climbing
- branch and bound method
- branch and bound procedure
- bnb adopt
- shared memory
- space complexity
- search strategy
- convex hull
- monte carlo
- tabu search
- constraint satisfaction problems
- scheduling problem
- cost function
- objective function
- bayesian networks