A branch-and-bound algorithm for the quadratic multiple knapsack problem
Krzysztof Fleszar
Topics & Concepts
Knapsack problemBenchmark (surveying)Upper and lower boundsBranch and boundPairwise comparisonComputationSet (abstract data type)MathematicsComputer scienceMathematical optimizationAlgorithmStatisticsMathematical analysisGeographyProgramming languageGeodesyOptimization and Packing ProblemsAdvanced Manufacturing and Logistics OptimizationOptimization and Search Problems