Reduction Algorithm for Zero-One Single Knapsack Problems

DOI10.1287/mnsc.20.4.460zbMath0304.90082OpenAlexW2104836429WikidataQ97016586 ScholiaQ97016586MaRDI QIDQ4060734

James F. Korsh, Giorgio P. Ingargiola

Publication date: 1973

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.20.4.460

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Some computational results on real 0-1 knapsack problems, An exact algorithm for the budget-constrained multiple knapsack problem, Exact methods for the knapsack problem and its generalizations, Comment on 'Some computational results on real 0-1 knapsack problems', A pegging approach to the precedence-constrained knapsack problem, An improved enumeration for pure 0-1 programs, Heuristic and reduction algorithms for the knapsack sharing problem, An improved direct descent algorithm for binary knapsack problems, A randomized parallel branch-and-bound algorithm, Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben, An expanding-core algorithm for the exact \(0-1\) knapsack problem, Dynamic programming algorithms for the zero-one knapsack problem, A branch and bound algorithm for the generalized assignment problem, Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, An algorithm for the 0/1 Knapsack problem, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, 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, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem, The zero-one knapsack problem with equality constraint, Zero-one integer programs with few contraints - lower bounding theory, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality