Comparison of a branch-and-bound heuristic, a newsvendor-based heuristic and periodic Bailey rules for outpatients appointment scheduling systems.
Sangdo (Sam) ChoiAmarnath (Andy) BanerjeePublished in: J. Oper. Res. Soc. (2016)
Keyphrases
- branch and bound
- optimal solution
- branch and bound procedure
- beam search
- tree search algorithm
- search algorithm
- combinatorial optimization
- tree search
- lower bound
- branch and bound method
- heuristic solution
- branch and bound algorithm
- branch and bound search
- lagrangian heuristic
- upper bound
- depth first search
- partial solutions
- search space
- linear programming relaxation
- search strategies
- column generation
- game tree search
- dynamic programming
- lagrangian relaxation
- search tree
- lower and upper bounds
- tabu search
- scheduling problem
- randomly generated problems
- np hard
- evolutionary algorithm
- probabilistic model
- neural network
- simulated annealing
- linear program
- constraint satisfaction