{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:07:28Z","timestamp":1648865248764},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0020-0190(01)00248-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"93-97","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing a mail-order with discount and shipping costs"],"prefix":"10.1016","volume":"82","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00248-4_BIB001","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the Knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00248-4_BIB002","series-title":"Proc. APPROX'99","first-page":"51","article-title":"A polynomial time approximation scheme for the multiple knapsack problem","volume":"1671","author":"Kellerer","year":"1999"},{"key":"10.1016\/S0020-0190(01)00248-4_BIB003","series-title":"26th WG'2000","first-page":"267","article-title":"Budget constraint minimum cost connected medians","volume":"1928","author":"Konjevod","year":"2000"},{"key":"10.1016\/S0020-0190(01)00248-4_BIB004","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00248-4_BIB005","series-title":"7th SWAT'2000","first-page":"175","article-title":"Scheduling jobs before shut-down","volume":"1851","author":"Liberatore","year":"2000"},{"key":"10.1016\/S0020-0190(01)00248-4_BIB006","series-title":"7th ESA'99","first-page":"29","article-title":"Approximation algorithms for the traveling purchaser problem and its variants in network design","volume":"1643","author":"Ravi","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T22:28:07Z","timestamp":1556836087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0020019001002484"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00248-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}