The zero/one multiple knapsack problem and genetic algorithms

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

Keywords

Knapsack problemCitationAlgorithmComputer scienceZero (linguistics)Operations researchMathematicsLibrary science

Affiliated Institutions

Related Publications

Conjugate coding

Stephen Wiesner

article Conjugate coding Share on Author: Stephen Wiesner Columbia University, New York, N.Y. Columbia University, New York, N.Y.View Profile Authors Info & Claims ACM SIGACT Ne...

1983 ACM SIGACT News 1420 citations

Fab

Marko Balabanović , Yoav Shoham

article Free AccessFab: content-based, collaborative recommendation Authors: Marko Balabanović Computer Science Department, Stanford University, Stanford, Calif. Computer Scienc...

1997 Communications of the ACM 2910 citations

Accessing nearby copies of replicated objects in a distributed environment

C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa

Article Free Access Share on Accessing nearby copies of replicated objects in a distributed environment Authors: C. Greg Plaxton Department of Computer Science, University of Te...

1997 762 citations

`` Direct Search'' Solution of Numerical and Statistical Problems

Robert Hooke , T. A. Jeeves

article Free Access`` Direct Search'' Solution of Numerical and Statistical Problems Authors: Robert Hooke Wesinghouse Research Laboratories, Pittsburgh, Pennsylvania Wesinghous...

1961 Journal of the ACM 4221 citations

Properties of Conflict-Free and Persistent Petri Nets

Lawrence H. Landweber , Edward L. Robertson

article Free Access Share on Properties of Conflict-Free and Persistent Petri Nets Authors: L. H. Landweber Computer Sciences Department, University of Wisconsin-Madison, Madiso...

1978 Journal of the ACM 165 citations

Publication Info

Year: 1994
Type: article
Pages: 188-193
Citations: 254
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

The zero/one multiple knapsack problem and genetic algorithms

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

254

OpenAlex

Cite This

APA Style

                            
                                    Sami Khuri, 
                                
                                    Thomas Bäck, 
                                
                                    Jörg Heitkötter
                                
                            (1994). 
                            The zero/one multiple knapsack problem and genetic algorithms. 
                            
                            , 188-193.
                            https://doi.org/10.1145/326619.326694

Identifiers

DOI: 10.1145/326619.326694