Depth-m search in branch-and-bound algorithms

This publication has 8 references indexed in Scilit:

• Theoretical comparisons of search strategies in branch-and-bound algorithms
  International Journal of Parallel Programming, 1976
• A Flexible Enumeration Scheme for Zero-One Programming
  Operations Research, 1974
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
  Journal of the ACM, 1974
• Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
  Operations Research, 1971
• Accelerating List Processing in Discrete Programming
  Journal of the ACM, 1970
• Branch-and-Bound Methods: General Formulation and Properties
  Operations Research, 1970
• Optimum Seeking with Branch and Bound
  Management Science, 1966
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966