{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:16:53Z","timestamp":1649193413296},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6741,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0166-218x(94)00106-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:02:29Z","timestamp":1027648949000},"page":"243-253","source":"Crossref","is-referenced-by-count":4,"title":["A polynomial approximation scheme for the subset sum problem"],"prefix":"10.1016","volume":"57","author":[{"given":"Nei Yoshihiro","family":"Soma","sequence":"first","affiliation":[]},{"given":"Alan Solon Ivor","family":"Zinober","sequence":"additional","affiliation":[]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[]},{"given":"Peter John","family":"Harley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00106-N_BIB1","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete variables extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)00106-N_BIB2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0167-6377(86)90065-9","article-title":"Worst-case analysis of an approximation scheme for the subset-sum problem","volume":"5","author":"Fischetti","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(94)00106-N_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)00106-N_BIB4","article-title":"Parallel computing in combinatorial optimization","author":"Kindervater","year":"1986"},{"key":"10.1016\/0166-218X(94)00106-N_BIB5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF02612360","article-title":"Worst-case analysis of greedy algorithms for the subset-sum problem","volume":"28","author":"Martello","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00106-N_BIB6","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1287\/mnsc.30.6.765","article-title":"A mixture of dynamic programming and branch-and-bound for the subset-sum problem","volume":"30","author":"Martello","year":"1984","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)00106-N_BIB7","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/0166-218X(94)00106-N_BIB8","article-title":"Serial and parallel algorithms for knapsack and related problems","author":"Soma","year":"1992"},{"key":"10.1016\/0166-218X(94)00106-N_BIB9","series-title":"Presented at CO92 Conference","article-title":"A Pseudopolylogarithmic algorithm for the subset sum problem","author":"Soma","year":"1992"},{"key":"10.1016\/0166-218X(94)00106-N_BIB10","series-title":"Presented at the ORSA\/TIMS Joint National Meeting","article-title":"An exact algorithm for the value independent Knapsack problem","author":"Yanasse","year":"1987"},{"key":"10.1016\/0166-218X(94)00106-N_BIB11","unstructured":"H.H. Yanasse and N.Y. Soma, The k-best solutions to the value independent knapsack problem, J. Oper. Res. Soc., submitted."},{"key":"10.1016\/0166-218X(94)00106-N_BIB12","article-title":"Practical microcomputer solutions to the cutting stock problem","author":"Zinober","year":"1992"},{"key":"10.1016\/0166-218X(94)00106-N_BIB13","article-title":"Practical microcomputer solutions to the cutting stock problem","author":"Zinober","year":"1991"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400106N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400106N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:54:45Z","timestamp":1555300485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400106N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0166218X9400106N"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00106-n","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}