Morrison, D.R., Jacobson, S.H., Sauppe, J.J. and Sewell, E.C. (2016) Branch-and-Bound Algorithms: A Survey of Recent Advances in Searching, Branching, and Pruning. Discrete Optimization, 19, 79-102.
https://doi.org/10.1016/j.disopt.2016.01.005

has been cited by the following article:

• TITLE: A Simulated Annealing Algorithm for Scheduling Problems

  AUTHORS: Crescenzio Gallo, Vito Capozzi

  KEYWORDS: Scheduling, Simulated Annealing, Discrete Optimization Algorithm

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.7 No.11, November 5, 2019

  ABSTRACT: An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The approximated method is examined together with its key parameters (freezing, tempering, cooling, number of contours to be explored), and the choices made in identifying these parameters are illustrated to generate a good algorithm that efficiently solves the scheduling problem.