Knapsack problem knapsack problem greedy algorithm GA

Source: Internet
Author: User

knapsack problem knapsack problem Greedy Algorithm GA

Give a point n items, the weight of the article J, the value, the capacity of the backpack for. What items should be selected in the bag so that the total value of the item is maximum?

Planning Models

Max

S.T.

Greedy algorithm (GA)

1, according to the value of the density from large to small into the package until the place, set at this time to put a s items

2. Compare the value obtained with the maximum value () and take the maximum output

The greedy algorithm and the optimal Solution competition ratio (approximate ratio) are

Prove:

Knapsack problem knapsack problem greedy algorithm GA

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.