Additional Key Words and Phrases: sequencing problem, algorithms, local search, branch-and-bound, guaranteed accuracy, computational results
Selected references
- Walter H. Kohler and Kenneth Steiglitz. Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of the ACM, 21(1):140-156, January 1974.
- Richard H. Roth. An approach to solving linear discrete optimization problems. Journal of the ACM, 17(2):303-313, April 1970.