Login / Signup
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Laura Galli
Silvano Martello
Carlos Rey
Paolo Toth
Published in:
Eur. J. Oper. Res. (2021)
Keyphrases
</>
knapsack problem
linear programming relaxation
combinatorial optimization problems
polynomial size
np hard
dynamic programming
optimization problems
semidefinite
optimal solution
exponential size
lower bound
objective function
linear programming