Publication | Closed Access

A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem

Mathematical ProgrammingEngineeringLinear OptimizationInteger OptimizationOptimization ProblemReduction ProcedureDiscrete OptimizationSystems EngineeringPacking ProblemsLogisticsDynamic ProgrammingLinear ProgrammingCombinatorial OptimizationKnapsack ProblemInteger ProgrammingOperations Research