Algorithm 37

swMATH25820MaRDI QIDQ37554FDOQ37554

Author name not available (Why is that?)

Official website: https://link.springer.com/article/10.1007%2FBF02252196

Described by source

• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem

Cited In (9)

• An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems
• A bound and bound algorithm for the zero-one multiple knapsack problem
• Exact methods for the knapsack problem and its generalizations
• Heuristic algorithms for the multiple knapsack problem
• The zero-one knapsack problem with equality constraint
• Constructive dual methods for discrete programming
• A new enumeration scheme for the knapsack problem
• An algorithm for the solution of the 0-1 knapsack problem
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for software: Algorithm 37