We show that for each 0 < ϵ ≤ 1 there exists an extended formulation for the knapsack problem, of size polynomial in the number of variables, whose value is at most ( 1 + ϵ ) times the value of the integer program.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage PlusPublished in last 50 years