Open AccessImprovement of the branch and bound algorithm for solving the knapsack linear integer problem
Author(s) -
Elias Munapo
Publication year - 2020
Publication title -
eastern-european journal of enterprise technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.268
H-Index - 24
eISSN - 1729-4061
pISSN - 1729-3774
DOI - 10.15587/1729-4061.2020.198849
Subject(s) - knapsack problem , change making problem , mathematics , integer programming , integer (computer science) , branch and cut , branch and bound , cutting stock problem , continuous knapsack problem , mathematical optimization , branch and price , linear programming , variable (mathematics) , upper and lower bounds , integer points in convex polyhedra , optimization problem , computer science , mathematical analysis , programming language