{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:36:41Z","timestamp":1787013401224,"version":"build-2736575974"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/tr.2010.2085530","type":"journal-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T14:08:39Z","timestamp":1289311719000},"page":"706-717","source":"Crossref","is-referenced-by-count":63,"title":["Redundancy Allocation for Series-Parallel Systems Using a Column Generation Approach"],"prefix":"10.1109","volume":"59","author":[{"given":"Leila","family":"Zia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David W.","family":"Coit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1525\/9780520411586-036","article-title":"nonlinear programming","author":"kuhn","year":"1951","journal-title":"Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917108"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.316"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00186-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/07408170490473097"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2006.879654"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.927807"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2006.884602"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.15807\/jorsj.46.145","article-title":"an improved surrogate constraints method for separable nonlinear integer programming","volume":"46","author":"nakagawa","year":"2003","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1968.5217517"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.5.838"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1978.5220232"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(91)90216-T"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00033-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222486"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.72"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1978.5220401"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/24.510811"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90008-Q"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(95)00114-X"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1080\/07408170304422","article-title":"efficiently solving the redundancy allocation problem using tabu search","volume":"35","author":"kulturel-konak","year":"2003","journal-title":"IIE Trans Reliability"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-7796(97)01155-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1977.5220101"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2004.832816"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/24.914551"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1981.5221024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/24.784268"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1985.5222133"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1987210201051","article-title":"A class of combinatorial optimization problems with polynomially solvable large scale set-covering\/partitioning relaxations","volume":"21","author":"minoux","year":"1987","journal-title":"RAIROOperations Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"ref26","author":"desrosiers","year":"1990","journal-title":"Handbook Operations Res Management Sci Networks"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01300970"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/24\/5629464\/05611640.pdf?arnumber=5611640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T13:24:51Z","timestamp":1740662691000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5611640\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tr.2010.2085530","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}