Reduction Algorithm for Zero-One Single Knapsack Problems

DOI10.1287/MNSC.20.4.460zbMATH Open0304.90082OpenAlexW2104836429WikidataQ97016586 ScholiaQ97016586MaRDI QIDQ4060734FDOQ4060734

Authors: Giorgio P. Ingargiola, James F. Korsh 

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)

Cited In (26)

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

This page was built for publication: Reduction Algorithm for Zero-One Single Knapsack Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060734)