{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T07:11:19Z","timestamp":1694589079925},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Sci"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10958-009-9614-9","type":"journal-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T06:54:48Z","timestamp":1252479288000},"page":"956-960","source":"Crossref","is-referenced-by-count":5,"title":["Solving huge size instances of the optimal diversity management problem"],"prefix":"10.1007","volume":"161","author":[{"given":"A.","family":"Agra","sequence":"first","affiliation":[]},{"given":"D. M.","family":"Cardoso","sequence":"additional","affiliation":[]},{"given":"J. O.","family":"Cerdeira","sequence":"additional","affiliation":[]},{"given":"M.","family":"Miranda","sequence":"additional","affiliation":[]},{"given":"E.","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"key":"9614_CR1","unstructured":"A. Agra and C. Requejo, \u201cOn the linking set problem,\u201d Cadernos de Matem\u00e1tica, Universidade de Aveiro, CM07 (2007)."},{"issue":"1","key":"9614_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10288-004-0059-1","volume":"3","author":"P Avella","year":"2005","unstructured":"P. Avella, M. Boccia, C. D. Martino, G. Oliviero, and A. Sforza, \u201cA decomposition approach for a very large scale optimal diversity management problem,\u201d 4OR 3, No. 1, 23\u201337 (2005).","journal-title":"4OR"},{"key":"9614_CR3","unstructured":"O. Briant, \u00c9tude Th\u00e9orique et Num\u00e9rique du Probl\u00e8me de la Gestion de la Diversit\u00e9, PhD thesis, Institut National Polytechnique de Grenoble (2000)."},{"issue":"4","key":"9614_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/opre.1040.0108","volume":"52","author":"O Briant","year":"2004","unstructured":"O.Briant and D. Naddef, \u201cThe optimal diversity management problem,\u201d Oper. Res., 52, No. 4, 515\u2013526 (2004).","journal-title":"Oper. Res."},{"key":"9614_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)."}],"container-title":["Journal of Mathematical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9614-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10958-009-9614-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9614-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:09:36Z","timestamp":1559470176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10958-009-9614-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9614"],"URL":"https:\/\/doi.org\/10.1007\/s10958-009-9614-9","relation":{},"ISSN":["1072-3374","1573-8795"],"issn-type":[{"value":"1072-3374","type":"print"},{"value":"1573-8795","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}