Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
From MaRDI portal
Publication:1251184
DOI10.1007/BF02252196zbMath0389.90070MaRDI QIDQ1251184
Publication date: 1978
Published in: Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Exact methods for the knapsack problem and its generalizations, A new enumeration scheme for the knapsack problem, Constructive dual methods for discrete programming, An improved direct descent algorithm for binary knapsack problems, The vehicle routing problem with backhauls, Tabu search for the multilevel generalized assignment problem, Optimal and canonical solutions of the change making problem, Heuristic algorithms for the multiple knapsack problem, A bound and bound algorithm for the zero-one multiple knapsack problem, An algorithm for the solution of the 0-1 knapsack problem, Designing a minimal spanning tree network subject to a budget constraint, Modelling and solving an FMS part selection problem, Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach, A Lagrangean dual-based solution method for a special linear programming problem, An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems, Algorithm 37, A heuristic lagrangean algorithm for the capacitated plant location problem, The zero-one knapsack problem with equality constraint, An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Cites Work
