{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:09Z","timestamp":1740122469186,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10898-019-00748-3","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T05:56:06Z","timestamp":1549691766000},"page":"21-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum variance allocation among constrained intervals"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3768-2987","authenticated-orcid":false,"given":"Hsin-Min","family":"Sun","sequence":"first","affiliation":[]},{"given":"Ruey-Lin","family":"Sheu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"issue":"4","key":"748_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973). \n                    https:\/\/doi.org\/10.1016\/S0022-0000(73)80033-9","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"748_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P Brucker","year":"1984","unstructured":"Brucker, P.: An \n                    \n                      \n                    \n                    $$O(n)$$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          )\n                        \n                      \n                    \n                   algorithm for quadratic knapsack problems. Oper. Res. Lett. 3(3), 163\u2013166 (1984). \n                    https:\/\/doi.org\/10.1016\/0167-6377(84)90010-5","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"748_CR3","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1137\/0724092","volume":"24","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Quasi\u2013Newton updates with bounds. SIAM J. Numer. Anal. 24(6), 1434\u20131441 (1987). \n                    https:\/\/doi.org\/10.1137\/0724092","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"748_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-014-0066-y","volume":"6","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Mascarenhas, W.F., Silva, P.J.S.: A Newton\u2019s method for the continuous quadratic knapsack problem. Math. Program. Comput. 6(2), 151\u2013169 (2014). \n                    https:\/\/doi.org\/10.1007\/s12532-014-0066-y","journal-title":"Math. Program. Comput."},{"issue":"3","key":"748_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2006). \n                    https:\/\/doi.org\/10.1007\/s10107-005-0595-2","journal-title":"Math. Program."},{"issue":"3","key":"748_CR6","doi-asserted-by":"publisher","first-page":"25pp","DOI":"10.1145\/2828635","volume":"42","author":"TA Davis","year":"2016","unstructured":"Davis, T.A., Hager, W.W., Hungerford, J.T.: An efficient hybrid algorithm for the separable convex quadratic knapsack problem. ACM Trans. Math. Softw. 42(3), 25pp (2016). \n                    https:\/\/doi.org\/10.1145\/2828635\n                    \n                  . Article 22","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"748_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/BF01588328","volume":"18","author":"R Helgason","year":"1980","unstructured":"Helgason, R., Kennington, J., Lall, H.: A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18(1), 338\u2013343 (1980). \n                    https:\/\/doi.org\/10.1007\/BF01588328","journal-title":"Math. Program."},{"key":"748_CR8","volume-title":"Resource Allocation Problems: Algorithmic Approaches. No. 4 in Foundations of Computing Series","author":"T Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. No. 4 in Foundations of Computing Series. The MIT Press, Cambridge (1988)"},{"issue":"3","key":"748_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10957-007-9259-0","volume":"134","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: On linear-time algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 134(3), 549\u2013554 (2007). \n                    https:\/\/doi.org\/10.1007\/s10957-007-9259-0","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"748_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10107-006-0050-z","volume":"112","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Program. 112(2), 473\u2013491 (2008). \n                    https:\/\/doi.org\/10.1007\/s10107-006-0050-z","journal-title":"Math. Program."},{"issue":"3","key":"748_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10957-007-9317-7","volume":"136","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Variable fixing algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 136(3), 445\u2013458 (2008). \n                    https:\/\/doi.org\/10.1007\/s10957-007-9317-7","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"748_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Kovoor, N.: An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Program. 46(1), 321\u2013328 (1990). \n                    https:\/\/doi.org\/10.1007\/BF01585748","journal-title":"Math. Program."},{"issue":"1","key":"748_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0024-3795(91)90267-Z","volume":"152","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Ye, Y., Han, C.-G.: Algorithms for the solution of quadratic knapsack problems. Linear Algebra Appl. 152(1), 69\u201391 (1991). \n                    https:\/\/doi.org\/10.1016\/0024-3795(91)90267-Z","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"748_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2006.12.006","volume":"185","author":"M Patriksson","year":"2008","unstructured":"Patriksson, M.: A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. 185(1), 1\u201346 (2008). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2006.12.006","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"748_CR15","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.ejor.2015.01.029","volume":"243","author":"M Patriksson","year":"2015","unstructured":"Patriksson, M., Str\u00f6mberg, C.: Algorithms for the continuous nonlinear resource allocation problem\u2014new implementations and numerical studies. Eur. J. Oper. Res. 243(3), 703\u2013722 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.01.029","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00748-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00748-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00748-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T19:08:50Z","timestamp":1581188930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00748-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00748-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"11 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}