On Combinatorial Properties of the Knapsack Problem
Sign Up to like & getrecommendations! Published in 2019 at "Computational Mathematics and Mathematical Physics"
DOI: 10.1134/s0965542519080074
Abstract: The knapsack problem with Boolean variables and a single constraint is studied. In the general case, this problem is NP-hard; for this reason, its exact solution requires the use of various search algorithms with the… read more here.
Keywords: properties knapsack; knapsack problem; problem; objective function ... See more keywords