{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:53Z","timestamp":1759847273597},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,3,29]]},"DOI":"10.1007\/s10589-007-9020-5","type":"journal-article","created":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T10:36:27Z","timestamp":1174386987000},"page":"35-47","source":"Crossref","is-referenced-by-count":8,"title":["Integer knapsack problems with set-up weights"],"prefix":"10.1007","volume":"37","author":[{"given":"Laura A.","family":"McLay","sequence":"first","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"9020_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172998","volume-title":"Algorithmic Geometry","author":"J.-D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.-D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"9020_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"Bruno, J., Downey, P.: Complexity of task scheduling with deadlines, set-up times and changeover costs. SIAM J. Comput. 7(4), 393\u2013404 (1978)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9020_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2), 333\u2013345 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9020_CR4","first-page":"124","volume":"32","author":"E.D. Chajakis","year":"1994","unstructured":"Chajakis, E.D., Guignard, M.: Exact algorithms for the setup knapsack problem. INFOR 32(3), 124\u2013142 (1994)","journal-title":"INFOR"},{"issue":"3","key":"9020_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/moor.3.3.197","volume":"3","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H., Kim, C.E.: Approximation algorithms for certain scheduling problems. Math. Oper. Res. 3(3), 197\u2013204 (1978)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9020_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","volume":"8","author":"D.S. Johnson","year":"1983","unstructured":"Johnson, D.S., Niemi, K.A.: On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8(1), 1\u201314 (1983)","journal-title":"Math. Oper. Res."},{"key":"9020_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"issue":"4","key":"9020_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E.L. Lawler","year":"1979","unstructured":"Lawler, E.L., Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339\u2013356 (1979)","journal-title":"Math. Oper. Res."},{"key":"9020_CR9","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"9020_CR10","unstructured":"McLay, L.A., Jacobson, S.H.: Integer knapsack problems with set-up weights. Technical report, University of Illinois, Urbana (2005)"},{"issue":"3","key":"9020_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/nav.20131","volume":"53","author":"L.A. McLay","year":"2006","unstructured":"McLay, L.A., Jacobson, S.H., Kobza, J.E.: A multilevel passenger screening problem for aviation security. Nav. Res. Log. 53(3), 183\u2013197 (2006)","journal-title":"Nav. Res. Log."},{"key":"9020_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(95)00113-6","volume":"72","author":"K. Park","year":"1997","unstructured":"Park, K., Park, S.: Lifting cover inequalities for the precedence-constrained knapsack problem. Discret. Appl. Math. 72, 219\u2013241 (1997)","journal-title":"Discret. Appl. Math."},{"key":"9020_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0166-218X(96)00134-5","volume":"77","author":"U. Pferschy","year":"1997","unstructured":"Pferschy, U., Pisinger, D., Woeginger, G.J.: Simple but efficient approaches for the collapsing knapsack problem. Discret. Appl. Math. 77, 271\u2013280 (1997)","journal-title":"Discret. Appl. Math."},{"key":"9020_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(98)00127-9","volume":"89","author":"D. Pisinger","year":"1998","unstructured":"Pisinger, D.: A fast algorithm for strongly correlated knapsack problems. Discret. Appl. Math. 89, 197\u2013212 (1998)","journal-title":"Discret. Appl. Math."},{"key":"9020_CR15","unstructured":"S\u00fcral, H., van Wassenhove, L.N., Potts, C.N.: The bounded knapsack problem with setups. Technical report, INSEAD, Centre for the Management of Environmental Resources, Report 97\/71\/TM, France (1997)"},{"issue":"2","key":"9020_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/002077299292498","volume":"30","author":"W.H. Yang","year":"1999","unstructured":"Yang, W.H., Liao, C.J.: Survey of scheduling research involving setup times. Int. J. Systems Sci. 30(2), 143\u2013155 (1999)","journal-title":"Int. J. Systems Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9020-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9020-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9020-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:31Z","timestamp":1559288191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9020-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,21]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,29]]}},"alternative-id":["9020"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9020-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,21]]}}}