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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties, 524p. Springer, Berlin (1999)
Fisher, M.L.: Worst-case Analysis of Heuristic Algorithms. Management Science 26(1), 1–17 (1980)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, 338p. Freeman, San Francisco (1979)
Gens, G.V., Levner, E.V.: Efficient Approximate Algortihms for Combinatorial Problems, 66p. The USSR Academy of Sciences, CEMI Press, Moscow (1980)
Guler, A., Nuriyeva, F.: Algorithms with guarantee value for bounded knapsack problems. In: Proceedings of 24th Mini Euro Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector (MEC EurOPT 2010), Izmir, Turkey, June 23-26, pp. 183–189 (2010)
Guler, A., Nuriyev, U., Berberler, M.E., Nuriyeva, F.: Algorithms with Guarantee Value for Knapsack Problems. Optimization 61(4), 477–488 (2012)
Güntzer, M.M., Jungnickel, D.: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem. Operations Research Letters 26, 55–66 (2000)
Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems, 596p. PWS Publishing, Boston (1997)
Horowitz, E., Sahni, S.: Computing Partitions with applications to the knapsack problem. Journal of ACM, 277–292 (1974)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of ACM 22(4), 463–468 (1975)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems, 546p. Springer, Berlin (2004)
Martello, S., Toth, P.: Knapsack Problems, 296p. John Wiley& Sons, England (1990)
Nikitin, A.I., Nuriev, U.G.: On a method of the solution of the knapsack problem. Kibernetika 2, 108–110 (1983)
Nuriev, U.G.: On the solution of the knapsack problem with guaranteed estimate, Problems of Computing Mathematics and Theoretical Cybernetics. The Cybernetics Institute Academy of Sciences of Azarbaijan SSP, 66–70 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Guler, A., Nurıyev, U. (2013). Complementary Problems for Subset-Sum and Change Making Problems. In: Nagamalai, D., Kumar, A., Annamalai, A. (eds) Advances in Computational Science, Engineering and Information Technology. Advances in Intelligent Systems and Computing, vol 225. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00951-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-00951-3_8
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00950-6
Online ISBN: 978-3-319-00951-3
eBook Packages: EngineeringEngineering (R0)