Complementary Problems for Subset-Sum and Change Making Problems
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.
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=c76a66f57f9d886b056583fd1ac28104https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10540
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
