Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems
Yu Yang, Natashia Boland, Bistra Dilkina, Martin Savelsbergh
Topics & Concepts
Branching (polymer chemistry)MathematicsSolverBoosting (machine learning)Mathematical optimizationVariable (mathematics)Knapsack problemSet (abstract data type)Computer scienceSearch treeTree (set theory)AlgorithmCombinatoricsSearch algorithmArtificial intelligenceMathematical analysisComposite materialMaterials scienceProgramming languageMetaheuristic Optimization Algorithms ResearchOptimization and Packing ProblemsVehicle Routing Optimization Methods