The Subset-Sum Problem as an Optimization Problem
Smart Innovation, Systems and Technologies, ISSN: 2190-3026, Vol: 159, Page: 693-700
2020
- 1Citations
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations1
- Citation Indexes1
- CrossRef1
Conference Paper Description
The subset-sum problem provides an essential role for numerous real-world applications such as coding theory and cryptography since it is the basis for several public key cryptography systems. This work deals with the subset-sum problem as an optimization problem with a variety of algorithms for tackling it. It additionally addresses its numerous applications. The experiments showed that the three developed systems are capable of providing the same known optimal results for the utilized benchmark data.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85075745145&origin=inward; http://dx.doi.org/10.1007/978-981-13-9282-5_66; http://link.springer.com/10.1007/978-981-13-9282-5_66; https://dx.doi.org/10.1007/978-981-13-9282-5_66; https://link.springer.com/chapter/10.1007/978-981-13-9282-5_66
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know