A Genetic Algorithm To Solve The Multidimensional  Knapsack Problem

dc.contributor.author	Berberler, M.E.
dc.contributor.author	Guler, A.
dc.contributor.author	Urfat, G.N.
dc.date.accessioned	2021-12-08T13:47:03Z
dc.date.available	2021-12-08T13:47:03Z
dc.date.issued	2013
dc.identifier.issn	1300-686X
dc.identifier.uri	https://app.trdizin.gov.tr/makale/TWpNek5EVTFOUT09/a-genetic-algorithm-to-solve-the-multidimensional-knapsack-problem
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/18346
dc.description.abstract	In this paper, The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm, initial population is not rand
dc.language.iso	English
dc.title	A Genetic Algorithm To Solve The Multidimensional Knapsack Problem
dc.relation.journal	Mathematical And Computational Applications
dc.relation.volume	18
dc.relation.issue	3
dc.identifier.issue	3
dc.identifier.startpage	486
dc.identifier.endpage	494
dc.identifier.volume	18

Files in this item

Files	Size	Format	View
There are no files associated with this item.