Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections

This publication has 12 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• On the Group Problem and a Subadditive Approach to Integer Programming
  Annals of Discrete Mathematics, 1979
• Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
  Operations Research, 1976
• The Theory and Computation of Knapsack Functions
  Operations Research, 1966
• Multistage Cutting Stock Problems of Two and More Dimensions
  Operations Research, 1965
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
  Proceedings of the National Academy of Sciences, 1965
• A Linear Programming Approach to the Cutting-Stock Problem
  Operations Research, 1961
• Outline of an algorithm for integer solutions to linear programs
  Bulletin of the American Mathematical Society, 1958
• Discrete-Variable Extremum Problems
  Operations Research, 1957
• The Trim Problem
  Management Science, 1957