Complementary Problems for Subset-Sum and Change Making Problems
Loading...
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag service@springer.de
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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. CMP and SSP are NP-hard problems and these problems can be seen as types of the knapsack problem in some ways. The complementary problems for the change making problem and the subsetsum problem are defined in this study and it is aimed to examine the CMP and SSP by means of the complementary problems. © 2015 Elsevier B.V. All rights reserved.
Description
Keywords
Change Making Problem, Complementary Problem, Greedy Algorithm, Subset-sum Problem, Computational Complexity, Information Technology, Integer Programming, Change Making Problem, Complementary Problems, Cutting Stock Problem, Greedy Algorithms, Knapsack Problems, Subset Sum, Subset-sum Problem, Loading, Computational complexity, Information technology, Integer programming, change making problem, Complementary problems, Cutting stock problem, Greedy algorithms, Knapsack problems, Subset sum, Subset-sum problem, Loading, Subset-Sum Problem, Change Making Problem, Greedy Algorithm, Complementary Problem, greedy algorithm, subset-sum problem, complementary problem, change making problem
Fields of Science
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
N/A
Source
3rd International Conference on Computational Science Engineering and Information Technology CCSEIT 2013
Volume
225
Issue
1
Start Page
81
End Page
88
Collections
PlumX Metrics
Citations
Scopus : 0
Google Scholar™
