[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

    Search the Q&A Archives

given a knapsack of weight capacity m>=0 and a set of ...

<< Back to: How to find sources (READ THIS BEFORE POSTING)

Question by dimple
Submitted on 4/8/2004
Related FAQ: How to find sources (READ THIS BEFORE POSTING)
Rating: Not yet rated Rate this question: Vote
given a knapsack of weight capacity m>=0 and a set of
objects.with weight and value of object is
wi>0 ,pi>0 for i=1,2,..n problem is to find a subset
X subset or equal to O of objects to be placed is the
knapsack which maximises the sum of objects placed
in knapsack with out exceeding its weight capacity m. how to write a program in C language for the above question


Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: How to find sources (READ THIS BEFORE POSTING)

[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]
© 2008 FAQS.ORG. All rights reserved.