A strongly polynomial FPTAS for the symmetric quadratic knapsack problem.

Published in: Eur. J. Oper. Res. (2012)

Keyphrases

strongly polynomial
minimum cost flow
linear programming
linear program
approximation algorithms
np hardness
np hard
knapsack problem
pareto optimal
minimum cost
neural network
shortest path
markov random field
dynamic programming
multi objective
special case
lower bound