Shortest path algorithms for knapsack type problems

This publication has 7 references indexed in Scilit:

• Some polyhedra related to combinatorial problems
  Linear Algebra and its Applications, 1969
• Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
  Operations Research, 1968
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
  Operations Research, 1968
• 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 note on two problems in connexion with graphs
  Numerische Mathematik, 1959