An Efficient Algorithm for the 0-1 Knapsack Problem
From MaRDI portal
Publication:4105496
DOI10.1287/mnsc.23.1.27zbMath0337.90042OpenAlexW2145068995MaRDI QIDQ4105496
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.23.1.27
Related Items
Some computational results on real 0-1 knapsack problems, Exact methods for the knapsack problem and its generalizations, An integer programming model for the allocation of databases in a distributed computer system, Optimizing single-terminal dispatch of large volume trips to trucks, Efficient algorithms for the capacitated concentrator location problem, Comment on 'Some computational results on real 0-1 knapsack problems', An improved enumeration for pure 0-1 programs, An exact approach for the 0-1 knapsack problem with setups, An improved direct descent algorithm for binary knapsack problems, Dynamic programming algorithms for the zero-one knapsack problem, Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, A fully polynomial approximation algorithm for the 0-1 knapsack problem, Coordinated production scheduling for make-to-order manufacturing, Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben, Single-vendor multi-buyer inventory coordination under private information, Lagrangian relaxation and pegging test for the clique partitioning problem, Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships, An algorithm for the 0/1 Knapsack problem, The 0-1 knapsack problem with multiple choice constraints, Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem, The Collapsing 0–1 Knapsack Problem, An algorithm and efficient data structures for the binary knapsack problem, Formulating and solving production planning problems, File allocation involving worst case response times and link capacities: Model and solution procedure, A successive approximation algorithm for the multiple knapsack problem, New trends in exact algorithms for the \(0-1\) knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, The zero-one knapsack problem with equality constraint, Solving capacitated clustering problems, Zero-one integer programs with few contraints - lower bounding theory, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
