1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Producing a Family of 0,1 Knapsack Sets

  1. Apr 18, 2017 #1
    • Moved from a technical forum, so homework template missing
    Dear Physics Forum friends,

    I am currently stuck with the following question about the integer optimization:

    "Produce a family of 0,1 knapsack sets (having an increasing number n of variables) whose associated family of minimal covers grows exponentially with n."

    My thought is that I need to partition the set based on taking each element from indices based on the constraint, but I am not sure. Frankly speaking, I am clueless as how to start solving this problem...Could you help me out?
     
  2. jcsd
  3. Apr 23, 2017 #2
    Thanks for the thread! This is an automated courtesy bump. Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post? The more details the better.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted