A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming.
Xue-Gang ZhouBing-Yuan CaoPublished in: J. Appl. Math. (2013)
Keyphrases
- branch and bound
- lower bound
- optimal solution
- np hard
- search space
- worst case
- computational complexity
- upper bound
- combinatorial optimization
- search algorithm
- branch and bound search
- branch and bound algorithm
- linear programming
- branch and bound method
- scheduling problem
- dynamic programming
- branch and bound procedure
- beam search
- integer programming problems
- monte carlo
- cost function
- search strategy
- lower and upper bounds
- tree search
- depth first search
- particle swarm optimization
- simulated annealing
- objective function