Parallel Empirical Stochastic Branch and Bound for large-scale discrete optimization via Simulation.
Scott RosenPeter SalemiBrian WickhamAshley WilliamsChristine HarveyErin CatlettSajjad TaghiyehJie XuPublished in: WSC (2016)
Keyphrases
- branch and bound
- discrete optimization
- combinatorial optimization problems
- combinatorial optimization
- search algorithm
- lower bound
- depth first search
- branch and bound algorithm
- optimal solution
- upper bound
- column generation
- search space
- branch and bound method
- branch and bound procedure
- network design problem
- tree search
- randomly generated problems
- traveling salesman problem
- beam search
- search strategies
- lagrangian heuristic
- knapsack problem
- linear programming
- integer programming problems
- tree search algorithm
- graph matching
- linear program
- simulated annealing
- dynamic programming
- special case
- pattern recognition
- computer vision
- machine learning