The zero/one multiple knapsack problem and genetic algorithms
Citations Over TimeTop 10% of 1994 papers
Abstract
Article The zero/one multiple knapsack problem and genetic algorithms Share on Authors: Sami Khuri San José State University San José State UniversityView Profile , Thomas Bäck University of Dortmund, Germany University of Dortmund, GermanyView Profile , Jörg Heitkötter University of Dortmund, Germany University of Dortmund, GermanyView Profile Authors Info & Claims SAC '94: Proceedings of the 1994 ACM symposium on Applied computingApril 1994 Pages 188–193https://doi.org/10.1145/326619.326694Online:06 April 1994Publication History 144citation3,435DownloadsMetricsTotal Citations144Total Downloads3,435Last 12 Months176Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Related Papers
- → The Multiple-Choice Knapsack Problem(2004)94 cited
- → STATIC STOCHASTIC KNAPSACK PROBLEMS(2015)4 cited
- → The Stochastic Knapsack(1995)2 cited
- A Summary of Genetic Algorithm on 0/1 Knapsack Problem(2013)
- KNAPSACK: Stata module to solve the knapsack problem(2019)