Publication | Closed Access

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringInteger OptimizationOptimization ProblemCombinatorial ProblemDiscrete OptimizationComputational ComplexityBound AlgorithmBranch And CutComputer ScienceUpper BoundDiscrete MathematicsCombinatorial OptimizationKnapsack ProblemBranch And BoundInteger ProgrammingOperations Research