{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:20:14Z","timestamp":1761895214638},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T00:00:00Z","timestamp":1294272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10898-010-9642-5","type":"journal-article","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T05:45:45Z","timestamp":1294206345000},"page":"657-673","source":"Crossref","is-referenced-by-count":12,"title":["An exact algorithm for the 0\u20131 linear knapsack problem with a single continuous variable"],"prefix":"10.1007","volume":"50","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,6]]},"reference":[{"key":"9642_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98, 145\u2013175 (2003)","journal-title":"Math. Program."},{"key":"9642_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Comu\u00e9jols G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"9642_CR3","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Comu\u00e9jols G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42, 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"9642_CR4","doi-asserted-by":"crossref","unstructured":"Buther, M., Briskorn, D.: Reducing the 0\u20131 knapsack problem with a single continuous variable to the standard 0\u20131 knapsack problem. Manuskripte aus den Instituten fur Betriebswirtschaftslehre der Universitat Kiel 629 (2007)","DOI":"10.4018\/joris.2012010101"},{"key":"9642_CR5","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability\u2014A Guide to the Theory of NP-completeness. Freeman W.H. and Company, San Francisco (1979)"},{"issue":"5","key":"9642_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/inte.1060.0232","volume":"36","author":"M.F. Gorman","year":"2006","unstructured":"Gorman M.F., Ahire S.: A major appliance manufacturer rethinks its inventory policies for service vehicles. Interfaces 36(5), 407\u2013419 (2006)","journal-title":"Interfaces"},{"issue":"1","key":"9642_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare C.A.R.: Quicksort. Comput. J. 5(1), 10\u201315 (1962)","journal-title":"Comput. J."},{"key":"9642_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer H., Pferschy U., Pisinger D.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"2","key":"9642_CR9","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A.N. Letchford","year":"2002","unstructured":"Letchford A.N., Lodi A.: Strengthening Chv\u00e1tal-Gomory cuts and gomory fractional cuts. Oper. Res. Lett. 30(2), 74\u201382 (2002)","journal-title":"Oper. Res. Lett."},{"key":"9642_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand H., Wolsey L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"key":"9642_CR11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand H., Wolsey L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363\u2013371 (2001)","journal-title":"Oper. Res."},{"issue":"3","key":"9642_CR12","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"Martello S., Pisinger D., Toth P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"9642_CR13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S. Martello","year":"2000","unstructured":"Martello S., Pisinger D., Toth P.: New trends in exact algorithms for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 123, 325\u2013332 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9642_CR14","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou C.H.: On the complexity of integer programming. J. ACM 28, 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"9642_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","volume":"87","author":"D. Pisinger","year":"1995","unstructured":"Pisinger D.: An expanding-core algorithm for the exact 0\u20131 Knapsack Problem. Eur. J. Oper. Res. 87, 175\u2013187 (1995)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9642-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9642-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9642-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T11:54:03Z","timestamp":1559908443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9642-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,6]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9642"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9642-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,6]]}}}