{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:47:14Z","timestamp":1740160034369,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T00:00:00Z","timestamp":1561334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T00:00:00Z","timestamp":1561334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s13198-019-00821-w","type":"journal-article","created":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:02:47Z","timestamp":1561356167000},"page":"918-924","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The equal tendency algorithm: a new heuristic for the reliability model"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6279-3729","authenticated-orcid":false,"given":"Elias","family":"Munapo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,24]]},"reference":[{"key":"821_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"Arora S, Barak B (2009) Computational complexity: a modern approach, 1st edn. Cambridge University Press, Cambridge","edition":"1"},{"key":"821_CR2","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"2017","unstructured":"Bertsekas DP (2017) Dynamic programming and optimal control, vol 1, 4th edn. Athena Scientific, Belmont","edition":"4"},{"key":"821_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400846610","volume-title":"The golden ticket: P, NP, and the search for the impossible","author":"F Fortnow","year":"2013","unstructured":"Fortnow F (2013) The golden ticket: P, NP, and the search for the impossible, 1st edn. Princeton University Press, Princeton","edition":"1"},{"key":"821_CR4","volume-title":"Computers intractability: a guide to the theory of NP Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers intractability: a guide to the theory of NP Completeness. W. H. Freeman, San Francisco"},{"issue":"1","key":"821_CR5","first-page":"3","volume":"11","author":"K Genova","year":"2011","unstructured":"Genova K, Guliashki V (2011) Linear integer programming methods and approaches\u2014a survey. Cybern Inf Technol 11(1):3\u201325","journal-title":"Cybern Inf Technol"},{"issue":"2012","key":"821_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio J (2012) Interior point methods 25\u00a0years later. Eur J Oper Res 218(2012):587\u2013601. https:\/\/doi.org\/10.1016\/j.ejor.2011.09","journal-title":"Eur J Oper Res"},{"key":"821_CR7","volume-title":"Operations research models and methods","author":"PA Jensen","year":"2003","unstructured":"Jensen PA, Bard JF (2003) Operations research models and methods. Wiley, New York"},{"issue":"2","key":"821_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/imaman\/dpi033","volume":"17","author":"W Johnston","year":"2006","unstructured":"Johnston W, Quigley JL, Walls LA (2006) Optimal allocation of reliability tasks to mitigate faults during new product development. IMA J Manag Math 17(2):159\u2013169","journal-title":"IMA J Manag Math"},{"key":"821_CR9","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol. IV, IEEE Service Center, Piscataway, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"7","key":"821_CR11","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1002\/qre.2115","volume":"33","author":"P Li","year":"2017","unstructured":"Li P, Li C, Dang W (2017) Accelerated reliability demonstration testing design based on reliability allocation of environmental stresses. Qual Reliab Eng Int 33(7):1425\u20131435. https:\/\/doi.org\/10.1002\/qre.2115","journal-title":"Qual Reliab Eng Int"},{"key":"821_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1996","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"821_CR13","unstructured":"Munapo E (2007) African journal of science and technology (AJST), science and engineering series, vol 8, no 2, pp 33\u201343"},{"key":"821_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4236\/ajor.2016.61001","volume":"6","author":"E Munapo","year":"2016","unstructured":"Munapo E (2016) Solving the binary linear programming model in polynomial time. Am J Oper Res 6:1\u20137. https:\/\/doi.org\/10.4236\/ajor.2016.61001","journal-title":"Am J Oper Res"},{"key":"821_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser G, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"821_CR16","volume-title":"Operations research: an introduction","author":"HA Taha","year":"2017","unstructured":"Taha HA (2017) Operations research: an introduction, 10th edn. Pearson Educators, Bengaluru","edition":"10"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-019-00821-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-019-00821-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-019-00821-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T04:07:08Z","timestamp":1721448428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-019-00821-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,24]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["821"],"URL":"https:\/\/doi.org\/10.1007\/s13198-019-00821-w","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"type":"print","value":"0975-6809"},{"type":"electronic","value":"0976-4348"}],"subject":[],"published":{"date-parts":[[2019,6,24]]},"assertion":[{"value":"9 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}