OurBigBook About$ Donate
 Sign in Sign up

Fractional row bound for quadratic knapsack (qi​=max{∑j=i​pij​yj​:∑j=i​wj​yj​≤B−wi​, 0≤yj​≤1})

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Integer programming Knapsack problem Quadratic knapsack problem
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Conditioning on selecting item i leaves capacity B−wi​. Its fractional knapsack problem bounds that item's total interaction with the other selected items. Thus the ordered-pair quadratic objective is at most ∑i​(vi​+qi​)xi​. Remove overweight items before defining their residual-capacity problems.

 Ancestors (7)

  1. Quadratic knapsack problem
  2. Knapsack problem
  3. Integer programming
  4. Mathematical optimization
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 212 / 2 / Solution

 Synonyms (1)

  • codex/fractional-row-bounds-for-quadratic-knapsack

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook