A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
Stefano Coniglio, Fabio Furini, Pablo San Segundo
Topics & Concepts
Knapsack problemBranch and boundChange-making problemContinuous knapsack problemMathematicsUpper and lower boundsBenchmark (surveying)Integer programmingSolverCutting stock problemCombinatorial optimizationMathematical optimizationBranch and cutPruningAlgorithmComputer scienceOptimization problemGeographyMathematical analysisAgronomyBiologyGeodesyComplexity and Algorithms in GraphsOptimization and Packing ProblemsOptimization and Search Problems