Solving the sequential ordering problem using branch and bound.
J. JamalGhassan ShobakiVassilis PapapanagiotouLuca Maria GambardellaRoberto MontemanniPublished in: SSCI (2017)
Keyphrases
- branch and bound
- combinatorial optimization
- integer programming problems
- branch and bound algorithm
- lower bound
- branch and bound search
- search algorithm
- upper bound
- search space
- column generation
- randomly generated problems
- branch and bound method
- branch and bound procedure
- optimal solution
- bnb adopt
- network design problem
- tree search algorithm
- implicit enumeration
- max sat
- linear programming relaxation
- beam search
- partial solutions
- tree search
- search strategies
- simulated annealing
- traveling salesman problem
- metaheuristic
- lagrangian heuristic
- integer program
- optimization problems
- multi objective
- lower and upper bounds
- tabu search
- linear programming
- previously solved
- parallel tree search