Login / Signup

Easily Computable Facets of the Knapsack Polytope.

Eitan Zemel
Published in: Math. Oper. Res. (1989)
Keyphrases
  • knapsack problem
  • facet defining inequalities
  • stable set
  • dynamic programming
  • upper bound
  • artificial neural networks
  • database
  • machine learning
  • optimal solution
  • facet defining