Publication | Closed Access

Upper and lower bounding procedures for the multiple knapsack assignment problem

Mathematical ProgrammingEngineeringInteger OptimizationOptimization ProblemKnapsack ProblemCombinatorial ProblemSystems EngineeringComputational ComplexityLogisticsLower Bounding ProceduresDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingOperations Research