Heuristic analysis, linear programming and branch and bound

This publication has 9 references indexed in Scilit:

• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
  Operations Research, 1979
• Cutting-plane theory: Algebraic methods
  Discrete Mathematics, 1978
• `` Strong '' NP-Completeness Results
  Journal of the ACM, 1978
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
  Management Science, 1977
• Approximate algorithms for some generalized knapsack problems
  Theoretical Computer Science, 1976
• Matching, Euler tours and the Chinese postman
  Mathematical Programming, 1973
• Blocking and anti-blocking pairs of polyhedra
  Mathematical Programming, 1971
• Partitioning procedures for solving mixed-variables programming problems
  Numerische Mathematik, 1962
• A Linear Programming Approach to the Cutting-Stock Problem
  Operations Research, 1961