Login / Signup

Analysis of Divide-and-Conquer strategies for the 0-1 minimization knapsack problem.

Fernando A. MoralesJairo A. Martínez
Published in: J. Comb. Optim. (2020)
Keyphrases
  • knapsack problem
  • combinatorial optimization problems
  • optimal solution
  • np hard
  • greedy heuristic
  • optimization problems
  • linear programming