{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:42:32Z","timestamp":1772044952801,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301516"],"award-info":[{"award-number":["11301516"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671419"],"award-info":[{"award-number":["11671419"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11631013"],"award-info":[{"award-number":["11631013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China (CN)","award":["71331001"],"award-info":[{"award-number":["71331001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10898-017-0514-0","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T23:24:51Z","timestamp":1490311491000},"page":"749-775","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new fully polynomial time approximation scheme for the interval subset sum problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Rui","family":"Diao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-Feng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"514_CR1","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: Solving low density knapsacks. In: Chaum, D. (ed.) Advances in Cryptology, pp. 25\u201337. Springer (1984)","DOI":"10.1007\/978-1-4684-4730-9_2"},{"issue":"3","key":"514_CR2","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/TPWRS.2006.876672","volume":"21","author":"M Carri\u00f3n","year":"2006","unstructured":"Carri\u00f3n, M., Arroyo, J.M.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371\u20131378 (2006)","journal-title":"IEEE Trans. Power Syst."},{"issue":"6","key":"514_CR3","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"V Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V.: Hard knapsack problems. Oper. Res. 28(6), 1402\u20131411 (1980)","journal-title":"Oper. Res."},{"issue":"2","key":"514_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex. 2(2), 111\u2013128 (1992)","journal-title":"Comput. Complex."},{"issue":"4","key":"514_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975)","journal-title":"J. ACM"},{"issue":"2","key":"514_CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., Mansini, R., Pferschy, U., Speranza, M.G.: An efficient fully polynomial approximation scheme for the subset-sum problem. J. Comput. Syst. Sci. 66(2), 349\u2013370 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"514_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: A new fully polynomial time approximation scheme for the knapsack problem. J. Comb. Optim. 3(1), 59\u201371 (1999)","journal-title":"J. Comb. Optim."},{"key":"514_CR8","doi-asserted-by":"crossref","unstructured":"Kothari, A., Suri, S., Zhou, Y.H.: Interval subset sum and uniform-price auction clearing. In: Wang, L. (ed.) Computing and Combinatorics, pp. 608\u2013620. Springer (2005)","DOI":"10.1007\/11533719_62"},{"issue":"1","key":"514_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM 32(1), 229\u2013246 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"514_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339\u2013356 (1979)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"514_CR11","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"MJ Magazine","year":"1981","unstructured":"Magazine, M.J., Oguz, O.: A fully polynomial approximation algorithm for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 8(3), 270\u2013273 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"514_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco (1979)"},{"issue":"1","key":"514_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1999.1034","volume":"33","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: Linear time algorithms for knapsack problems with bounded weights. J. Algorithms 33(1), 1\u201314 (1999)","journal-title":"J. Algorithms"},{"issue":"1","key":"514_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s40305-013-0004-0","volume":"1","author":"XL Sun","year":"2013","unstructured":"Sun, X.L., Zheng, X.J., Li, D.: Recent advances in mathematical programming with semi-continuous variables and cardinality constraint. J. Oper. Res. Soc. China 1(1), 55\u201377 (2013)","journal-title":"J. Oper. Res. Soc. China"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0514-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0514-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0514-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T07:32:43Z","timestamp":1499931163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0514-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0514-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,23]]}}}