Solving 0–1 knapsack problem by a novel global harmony search algorithm

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Solving 0–1 knapsack problem by a novel global harmony search algorithm
Authors
Keywords
-
Journal
APPLIED SOFT COMPUTING
Volume 11, Issue 2, Pages 1556-1564
Publisher
Elsevier BV
Online
2010-08-07
DOI
10.1016/j.asoc.2010.07.019

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.