An O(n log n) procedure for identifying facets of the knapsack polytope.

Laureano F. Escudero María Araceli Garín Gloria Pérez

Published in: Oper. Res. Lett. (2003)

Keyphrases

knapsack problem
dynamic programming
facet defining inequalities
upper bound
facet defining
genetic algorithm
lower bound
convex hull
neural network
worst case
semidefinite
stable set
lattice points