{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:29:46Z","timestamp":1648826986451},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T00:00:00Z","timestamp":1185580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10878-007-9091-3","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T11:05:20Z","timestamp":1185534320000},"page":"1-15","source":"Crossref","is-referenced-by-count":0,"title":["Online coupon consumption problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Yiwei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,28]]},"reference":[{"key":"9091_CR1","volume-title":"Computer algorithms: Introduction to design and analysis","author":"S Basse","year":"1988","unstructured":"Basse S (1988) Computer algorithms: Introduction to design and analysis. Addison\u2013Wesley, Reading"},{"key":"9091_CR2","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"EG Coffman","year":"1997","unstructured":"Coffman EG, Garey MR, Johnson DS (1997) Approximation algorithms for bin packing: A survey. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS, Boston, pp\u00a046\u201393"},{"key":"9091_CR3","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.ic.2006.02.003","volume":"204","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa G, He Y (2006) Bin packing problems with rejection penalties and their dual problems. Inf Comput 204:795\u2013815","journal-title":"Inf Comput"},{"key":"9091_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/11970125_12","volume-title":"Proceeding of the 4th workshop on approximation and online algorithms","author":"L Epstein","year":"2007","unstructured":"Epstein L (2007) Bin packing with rejection revisited. In: Proceeding of the 4th workshop on approximation and online algorithms. Lecture notes in computer science, vol\u00a04368. Springer, Berlin, pp\u00a0146\u2013159"},{"key":"9091_CR5","first-page":"1","volume-title":"Lecture notes in computer sciences","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger G (1998) On-line algorithms: the state of art. In: Lecture notes in computer sciences, vol\u00a01442. Springer, Berlin, pp\u00a01\u201312"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9091-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9091-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9091-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9091-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,28]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9091"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9091-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,28]]}}}