A hybrid approach to discrete mathematical programming

This publication has 23 references indexed in Scilit:

• The Power of Dominance Relations in Branch-and-Bound Algorithms
  Journal of the ACM, 1977
• A dual algorithm for the one-machine scheduling problem
  Mathematical Programming, 1976
• Merging and Sorting Applied to the Zero-One Knapsack Problem
  Operations Research, 1975
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
  Management Science, 1975
• When the Greedy Solution Solves a Class of Knapsack Problems
  Operations Research, 1975
• A HEURISTIC FOR GENERAL INTEGER PROGRAMMING*
  Decision Sciences, 1974
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
  Management Science, 1972
• Discontinuities of optimal return in dynamic programming
  Journal of Mathematical Analysis and Applications, 1970
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
  Operations Research, 1969
• Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
  Operations Research, 1965