Login / Signup
Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem.
Fernando A. Morales
Jairo A. Martínez
Published in:
CoRR (2020)
Keyphrases
</>
knapsack problem
implicit enumeration
cost function
dynamic programming
mathematical model
worst case scenario
np hard
optimization problems
combinatorial optimization problems
quadratic programming