Complementary Problems for Subset-Sum and Change Making Problems

dc.contributor.author	Guler, A.
dc.contributor.author	Nuriyev, U.G.
dc.date.accessioned	2021-01-25T20:50:51Z
dc.date.available	2021-01-25T20:50:51Z
dc.date.issued	2013
dc.identifier	10.1007/978-3-319-00951-3_8
dc.identifier.issn	21945357
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84882954653&doi=10.1007%2f978-3-319-00951-3_8&partnerID=40&md5=c76a66f57f9d886b056583fd1ac28104
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10540
dc.description.abstract	In this study, Change Making Problem (CMP) and Subset-Sum Problem (SSP), which can arise, in practice, in some classes of one dimensional cargo loading and cutting stock problems, are researched. These problems are often used in computer science, as well.
dc.language.iso	English
dc.publisher	Advances in Intelligent Systems and Computing
dc.title	Complementary Problems for Subset-Sum and Change Making Problems
dc.type	Conference Paper
dc.relation.firstpage	81
dc.relation.lastpage	88
dc.relation.volume	225
dc.relation.issue	1
dc.description.affiliations	Department of Mathematics, Yasar University, Izmir, Turkey; Department of Mathematics, Ege University, Izmir, Turkey

Files in this item

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