{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:59:48Z","timestamp":1762430388942},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T00:00:00Z","timestamp":1261612800000},"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":[[2011,7]]},"DOI":"10.1007\/s10878-009-9273-2","type":"journal-article","created":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T16:39:40Z","timestamp":1261586380000},"page":"71-77","source":"Crossref","is-referenced-by-count":12,"title":["On the Bandpass problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Guohui","family":"Lin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,24]]},"reference":[{"key":"9273_CR1","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin EM, Hassin R (1998) On local search for weighted packing problems. Math Oper Res 23:640\u2013648","journal-title":"Math Oper Res"},{"key":"9273_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10878-008-9143-3","volume":"18","author":"DA Babayev","year":"2009","unstructured":"Babayev DA, Bell GI, Nuriyev UG (2009) The bandpass problem: combinatorial optimization and library of problems. J Comb Optim 18:151\u2013172","journal-title":"J Comb Optim"},{"key":"9273_CR3","unstructured":"Bell GI, Babayev DA (2004) Bandpass problem. In: Annual INFORMS meeting, October 2004, Denver, CO, USA"},{"key":"9273_CR4","unstructured":"Chandra B, Halld\u00f3rsson MM (1999) Greedy local improvement and weighted set packing approximation. In: ACM-SIAM proceedings of the tenth annual symposium on discrete algorithms (SODA\u201999), pp 169\u2013176"},{"key":"9273_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9273-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9273-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9273-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:15Z","timestamp":1559261895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9273-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,24]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9273"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9273-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,24]]}}}