Heuristic Techniques for Solving Large Combinatorial Problems on a Computer

This publication has 11 references indexed in Scilit:

• The Traveling Salesman Problem: A Survey
  Operations Research, 1968
• Integer Programming by Implicit Enumeration and Balas’ Method
  SIAM Review, 1967
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966
• Backtrack Programming
  Journal of the ACM, 1965
• A Heuristic Approach to Solving Travelling Salesman Problems
  Management Science, 1964
• An Algorithm for the Traveling Salesman Problem
  Operations Research, 1963
• A Dynamic Programming Approach to Sequencing Problems
  Journal of the Society for Industrial and Applied Mathematics, 1962
• Dynamic Programming Treatment of the Travelling Salesman Problem
  Journal of the ACM, 1962
• Isomorph rejection in exhaustive search techniques
  Proceedings of Symposia in Applied Mathematics, 1960
• Minimization of Boolean Functions*
  Bell System Technical Journal, 1956