乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:25:59Z","timestamp":1725467159391},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CMMI-1162034","CMMI-0758061","CMMI-0824674"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["CMMI-0846554","FA9550-11-1-0150"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MITEI Energy Initiative Seed Fund"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1016\/j.orl.2014.06.007","type":"journal-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T15:31:19Z","timestamp":1403278279000},"page":"367-373","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications"],"prefix":"10.1016","volume":"42","author":[{"given":"Retsef","family":"Levi","sequence":"first","affiliation":[]},{"given":"Georgia","family":"Perakis","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Romero","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2014.06.007_br000005","series-title":"Handbook of Global Optimization","first-page":"43","article-title":"Concave minimization: theory, applications and algorithms","author":"Benson","year":"1995"},{"key":"10.1016\/j.orl.2014.06.007_br000010","doi-asserted-by":"crossref","unstructured":"S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge, 2007, pp. 215\u2013288.","DOI":"10.1109\/CHICC.2006.280567"},{"key":"10.1016\/j.orl.2014.06.007_br000015","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","article-title":"The nonlinear knapsack problem\u2014algorithms and applications","volume":"92","author":"Bretthauer","year":"2002","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.orl.2014.06.007_br000020","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.orl.2007.04.001","article-title":"Allocating procurement to capacitated suppliers with concave quantity discounts","volume":"36","author":"Burke","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2014.06.007_br000025","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/msom.1080.0242","article-title":"Cournot competition under yield uncertainty: the case of the US influenza vaccine market","volume":"11","author":"Deo","year":"2009","journal-title":"Manuf. Serv. Oper. Manage."},{"key":"10.1016\/j.orl.2014.06.007_br000030","series-title":"Game Theory","author":"Fudenberg","year":"1991"},{"key":"10.1016\/j.orl.2014.06.007_br000035","series-title":"Proceedings of the Nineteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"700","article-title":"Fully polynomial time approximation schemes for stochastic dynamic programs","author":"Halman","year":"2008"},{"key":"10.1016\/j.orl.2014.06.007_br000040","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.orl.2014.06.007_br000045","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","article-title":"The budgeted maximum coverage problem","volume":"70","author":"Khuller","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.orl.2014.06.007_br000050","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01588800","article-title":"On the solution of concave knapsack problems","volume":"49","author":"More","year":"1991","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2014.06.007_br000055","series-title":"Network Economics: A Variational Inequality Approach","author":"Nagurney","year":"1999"},{"key":"10.1016\/j.orl.2014.06.007_br000060","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","article-title":"Computationally related problems","volume":"3","author":"Sahni","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2014.06.007_br000065","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1377\/hlthaff.2011.0403","article-title":"Economic perspectives on the advance market commitment for pneumococcal vaccines","volume":"30","author":"Snyder","year":"2011","journal-title":"Health Aff."},{"key":"10.1016\/j.orl.2014.06.007_br000070","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","article-title":"A note on maximizing a submodular set function subject to a knapsack constraint","volume":"32","author":"Sviridenko","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2014.06.007_br000075","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.orl.2014.06.007_br000080","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/moor.7.3.410","article-title":"Maximising real-valued submodular functions: primal and dual heuristics for location problems","volume":"7","author":"Wolsey","year":"1982","journal-title":"Math. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637714000868?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637714000868?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:28:50Z","timestamp":1649464130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637714000868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["S0167637714000868"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2014.06.007","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2014.06.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}