{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:59Z","timestamp":1759667759212},"reference-count":22,"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-9612-y","type":"journal-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T03:38:02Z","timestamp":1252467482000},"page":"919-929","source":"Crossref","is-referenced-by-count":7,"title":["The linking set problem: a polynomial special case of the multiple-choice knapsack problem"],"prefix":"10.1007","volume":"161","author":[{"given":"A.","family":"Agra","sequence":"first","affiliation":[]},{"given":"C.","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"key":"9612_CR1","unstructured":"A. Agra, D. Cardoso, J. Cerdeira, M. Miranda, and E. Rocha, \u201cThe minimum weight spanning star forest model of the optimal diversity management problem,\u201d Cadernos de Matem\u00e1tica, Universidade de Aveiro, CM07(I-08) (2007)."},{"key":"9612_CR2","unstructured":"A. Agra and C. Requejo, \u201cOn the Linking set problem,\u201d Cadernos de Matem\u00e1tica, Universidade de Aveiro, CM07 (2007)."},{"key":"9612_CR3","first-page":"113","volume":"71","author":"EH Aghezzaf","year":"1995","unstructured":"E. H. Aghezzaf, T. L. Magnanti, and L. A. Wolsey, \u201cOptimizing constrained subtrees of trees,\u201d Math. Program., 71, 113\u2013126 (1995).","journal-title":"Math. Program."},{"issue":"1","key":"9612_CR4","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 Oper. Res., 3, No. 1, 23\u201337 (2005).","journal-title":"Oper. Res."},{"key":"9612_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01585522","volume":"7","author":"D Babayev","year":"2005","unstructured":"D. Babayev, \u201cComments on a note of Frieze,\u201d Math. Program., 7, 249\u2013252 (2005).","journal-title":"Math. Program."},{"key":"9612_CR6","unstructured":"O. Briant, \u00c9tude Th\u00e9orique et Num\u00e9rique du Probl\u00e8me de la Qestion de la Diversit\u00e9, PhD Thesis, Institut National Polytechnique de Grenoble (2000)."},{"issue":"4","key":"9612_CR7","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":"9612_CR8","unstructured":"D. Cardoso and J. Cerdeira, \u201cMinimum weight t-composition of an integer,\u201d Cadernos de Matem\u00e1tica, Universidade de Aveiro (2007)."},{"key":"9612_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-6377(84)90027-0","volume":"3","author":"K Dudzinski","year":"1984","unstructured":"K. Dudzinski and S. Waluckiewicz, \u201cA fast algorithm for the linear multiple-choice knapsack problem,\u201d Oper. Res. Lett., 3, 205\u2013209 (1984).","journal-title":"Oper. Res. Lett."},{"key":"9612_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"L Fisher","year":"1978","unstructured":"L. Fisher, G. Nemhauser, and L. Wolsey, \u201cAn analysis of approximations for maximizing submodular set functions. II,\u201d Math. Program. Study, 8, 73\u201387 (1978).","journal-title":"Math. Program. Study"},{"key":"9612_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01585521","volume":"7","author":"A Frieze","year":"1974","unstructured":"A. Frieze, \u201cA cost function property for plant location problems,\u201d Math. Program., 7, 245\u2013248 (1974).","journal-title":"Math. Program."},{"key":"9612_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/opre.20.1.173","volume":"20","author":"P Jarvinen","year":"1972","unstructured":"P. Jarvinen, J. Rajala, and H. Sinervo, \u201cA branch and bound algorithm for seeking the p-median, Oper. Res., 20, 173\u2013178 (1972).","journal-title":"Oper. Res."},{"key":"9612_CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"O. Kariv and S. Hakini, \u201cAn algorithmic approach to network location problems. Part 1. The p-centers,\u201d SIAM J. Appl. Math., 37, 513\u2013538 (1979).","journal-title":"SIAM J. Appl. Math."},{"key":"9612_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, Berlin (2004)."},{"key":"9612_CR15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"E. L. Lawler, \u201cFast approximation algorithms for knapsack problems,\u201d Math. Oper. Res., 4, 339\u2013356 (1979).","journal-title":"Math. Oper. Res."},{"key":"9612_CR16","unstructured":"S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley (1990)."},{"key":"9612_CR17","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"K Martin","year":"1978","unstructured":"K. Martin, \u201cGenerating alternative mixed-integer programming models using variable redefinition,\u201d Oper. Res., 35, 820\u2013831 (1978).","journal-title":"Oper. Res."},{"key":"9612_CR18","unstructured":"P. Mirchandani and R. Francis, Discrete Location Theory, Wiley (1990)."},{"key":"9612_CR19","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D Pisinger","year":"1995","unstructured":"D. Pisinger, \u201cA minimal algorithm for the multiple-choice knapsack problem,\u201d Eur. J. Oper. Res., 83, 394\u2013410 (1995).","journal-title":"Eur. J. Oper. Res."},{"key":"9612_CR20","doi-asserted-by":"crossref","unstructured":"J. Reese, \u201cSolution methods for the p-median problem: an annotated bibliography,\u201d Networks, 125\u2013142 (2006).","DOI":"10.1002\/net.20128"},{"key":"9612_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/mnsc.16.3.165","volume":"16","author":"K Spielberg","year":"1969","unstructured":"K. Spielberg, \u201cPlant location with generalized search origin,\u201d Management Sci., 16, 165\u2013178 (1969).","journal-title":"Management Sci."},{"key":"9612_CR22","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2006.10.031","volume":"183","author":"B You","year":"2007","unstructured":"B. You and T. Yamada, \u201cA pegging approach to the precedence-constrained knapsack problem,\u201d European J. Oper. Res., 183, 618\u2013632 (2007).","journal-title":"European J. Oper. Res."}],"container-title":["Journal of Mathematical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9612-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10958-009-9612-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9612-y","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-9612-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9612"],"URL":"https:\/\/doi.org\/10.1007\/s10958-009-9612-y","relation":{},"ISSN":["1072-3374","1573-8795"],"issn-type":[{"value":"1072-3374","type":"print"},{"value":"1573-8795","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}