{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:13:35Z","timestamp":1759666415960,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100015570","name":"NFSC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015570","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10898-017-0540-y","type":"journal-article","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T09:21:06Z","timestamp":1498641666000},"page":"713-725","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Knapsack with variable weights satisfying linear constraints"],"prefix":"10.1007","volume":"69","author":[{"given":"Kameng","family":"Nip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zizhuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"issue":"1","key":"540_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams, W.P., Sherali, H.D.: Mixed-integer bilinear programming problems. Math. Program. 59(1), 279\u2013305 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"540_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201911, pp. 1647\u20131665. SIAM (2011)","key":"540_CR3","DOI":"10.1137\/1.9781611973082.127"},{"issue":"2","key":"540_CR4","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: A survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"3","key":"540_CR5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"unstructured":"Dean, B.C.: Approximation algorithms for stochastic scheduling problems. Ph.D. thesis, Massachusetts Institute of Technology, Boston (2005)","key":"540_CR6"},{"key":"540_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"issue":"2","key":"540_CR8","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1 - \\epsilon }$$ n 1 - \u03f5 . In: Proceedings 37th Annual Symposium on Foundations of Computer Science, pp. 627\u2013636 (1996)","key":"540_CR9","DOI":"10.1109\/SFCS.1996.548522"},{"issue":"4","key":"540_CR10","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"},{"key":"540_CR11","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, New York (2004)"},{"key":"540_CR12","series-title":"IMA Volumes in Mathematics and its Applications","first-page":"533","volume-title":"Mixed-Integer Nonlinear Programming","author":"M K\u00f6ppe","year":"2011","unstructured":"K\u00f6ppe, M.: On the complexity of nonlinear mixed-integer optimization. In: Lee, J., Leyffer, S. (eds.) Mixed-Integer Nonlinear Programming. IMA Volumes in Mathematics and its Applications, vol. 154, pp. 533\u2013558. Springer, Berlin (2011)"},{"issue":"4","key":"540_CR13","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/120880355","volume":"23","author":"M Monaci","year":"2013","unstructured":"Monaci, M., Pferschy, U.: On the robust knapsack problem. SIAM J. Optim. 23(4), 1956\u20131982 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"540_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2016.02.028","volume":"253","author":"K Nip","year":"2016","unstructured":"Nip, K., Wang, Z., Wang, Z.: Scheduling under linear constraints. Eur. J. Oper. Res. 253(2), 290\u2013297 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"540_CR15","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"540_CR16","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10878-007-9116-y","volume":"17","author":"Z Wang","year":"2009","unstructured":"Wang, Z., Xing, W.: A successive approximation algorithm for the multiple knapsack problem. J. Comb. Optim. 17(4), 347\u2013366 (2009)","journal-title":"J. Comb. Optim."},{"key":"540_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"540_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience, New York (1997)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0540-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0540-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0540-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T03:37:43Z","timestamp":1750390663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0540-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0540-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,6,28]]}}}