{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:12:34Z","timestamp":1773454354997,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T00:00:00Z","timestamp":1227657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10732-008-9100-4","type":"journal-article","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T19:38:26Z","timestamp":1228333106000},"page":"239-258","source":"Crossref","is-referenced-by-count":12,"title":["Alternating control tree search for knapsack\/covering problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Lars Magnus","family":"Hvattum","sequence":"first","affiliation":[]},{"given":"Halvard","family":"Arntzen","sequence":"additional","affiliation":[]},{"given":"Arne","family":"L\u00f8kketangen","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,26]]},"reference":[{"issue":"1","key":"9100_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007)","journal-title":"Discrete Optim."},{"key":"9100_CR2","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1016\/j.cor.2005.07.007","volume":"33","author":"H. Arntzen","year":"2006","unstructured":"Arntzen, H., Hvattum, L.M., L\u00f8kketangen, A.: Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33, 2508\u20132525 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9100_CR3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7","volume":"48","author":"G.J. Beaujon","year":"2001","unstructured":"Beaujon, G.J., Marin, S.P., McDonald, G.C.: Balancing and optimizing a portfolio of r&d projects. Nav. Res. Logist. 48, 18\u201340 (2001)","journal-title":"Nav. Res. Logist."},{"key":"9100_CR4","unstructured":"Cappanera, P.: Discrete facility location and routing of obnoxious facilities. PhD\u00a0thesis, University of Milano (1999)"},{"key":"9100_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.1030.0050","volume":"17","author":"P. Cappanera","year":"2005","unstructured":"Cappanera, P., Trubian, M.: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem. INFORMS J. Comput. 17, 82\u201398 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9100_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J.\u00a0Heuristics 4, 63\u201386 (1998)","journal-title":"J.\u00a0Heuristics"},{"issue":"1","key":"9100_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71\u201390 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"9100_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1), 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"9100_CR9","first-page":"215","volume-title":"Management of Distributed Data Processing","author":"B. Gavish","year":"1982","unstructured":"Gavish, B., Pirkul, H.: Allocation of databases and processors in a distributed computing system. In: Akoka,\u00a0J. (ed.) Management of Distributed Data Processing, pp.\u00a0215\u2013231. North-Holland, Amsterdam (1982)"},{"key":"9100_CR10","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Oper. Res. 14, 1045\u20131075 (1966)","journal-title":"Oper. Res."},{"issue":"1","key":"9100_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9100_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"key":"9100_CR13","doi-asserted-by":"crossref","unstructured":"Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Proceedings, CPAIOR 2004 (2004)","DOI":"10.1007\/978-3-540-30201-8_22"},{"key":"9100_CR14","doi-asserted-by":"crossref","unstructured":"Gomes, C., van Hoeve, W., Leahu, L.: The power of semidefinite programming relaxations for MAX-SAT. In: Proceedings, CPAIOR 2006, pp.\u00a0104\u2013118 (2006)","DOI":"10.1007\/11757375_10"},{"key":"9100_CR15","unstructured":"Hanafi, S., Wilbaut, C.: Improved convergent heuristic for 0\u20131 mixed integer programming. Research Report, University of Valenciennes (2006)"},{"issue":"3","key":"9100_CR16","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48(3), 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"9100_CR17","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-0-387-71921-4_1","volume-title":"Metaheuristics: Progress in Complex Systems Optimization","author":"L.M. Hvattum","year":"2007","unstructured":"Hvattum, L.M., L\u00f8kketangen, A.: Experiments using scatter search for the multidemand multidimensional knapsack problem. In: Doerner,\u00a0K.F., et al. (eds.) Metaheuristics: Progress in Complex Systems Optimization. Operations Research\/Computer Science Interfaces, vol.\u00a039, pp.\u00a03\u201324. Springer, Berlin (2007)"},{"key":"9100_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search: Methodology and Implementations in\u00a0C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter Search: Methodology and Implementations in\u00a0C. Kluwer Academic, Dordrecht (2003)"},{"key":"9100_CR19","first-page":"229","volume":"28","author":"J. Lorie","year":"1955","unstructured":"Lorie, J., Savage, L.: Three problems in capital rationing. J.\u00a0Bus. 28, 229\u2013239 (1955)","journal-title":"J.\u00a0Bus."},{"key":"9100_CR20","first-page":"85","volume":"25","author":"A. Manne","year":"1957","unstructured":"Manne, A., Markowitz, H.: On the solution of discrete programming problems. Econometrica 25, 85\u2013110 (1957)","journal-title":"Econometrica"},{"key":"9100_CR21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0377-2217(00)00169-7","volume":"129","author":"F. Plastria","year":"2001","unstructured":"Plastria, F.: Static competitive facility location: an\u00a0overview of optimization approaches. Eur. J. Oper. Res. 129, 461\u2013470 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9100_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/11499305_5","volume-title":"Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part\u00a0II","author":"J. Puchinger","year":"2005","unstructured":"Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A\u00a0survey and classification. In: Mira,\u00a0J., \u00c1lvarez,\u00a0J.R. (eds.) Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a03562, pp.\u00a041\u201353. Springer, Berlin (2005)"},{"key":"9100_CR23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0377-2217(97)00110-0","volume":"102","author":"D. Romero-Morales","year":"1997","unstructured":"Romero-Morales, D., Carrizosa, E., Conde, E.: Semi-obnoxious location models: a\u00a0global optimization approach. Eur. J. Oper. Res. 102, 295\u2013301 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9100_CR24","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"9100_CR25","doi-asserted-by":"crossref","unstructured":"Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network. In: Proceedings of the Tenth Annual European Symposium on Algorithms, pp.\u00a0845\u2013858 (2002)","DOI":"10.1007\/3-540-45749-6_73"},{"key":"9100_CR26","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W. Shih","year":"1979","unstructured":"Shih, W.: A branch and bound method for the multiconstraint zero-one knapsack problem. J.\u00a0Oper. Res. Soc. 30, 369\u2013378 (1979)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9100_CR27","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"A.L. Soyster","year":"1978","unstructured":"Soyster, A.L., Lev, B., Slivka, W.: Zero-one programming with many variables and few constraints. Eur. J. Oper. Res. 2, 195\u2013201 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"9100_CR28","unstructured":"Vasquez, M., Hao, J.-K.: A hybrid approach for the 0\u20131 multidimensional knapsack problem. In: Proceedings of the International Joint Conference on Artificial Intelligence 2001, pp.\u00a0328\u2013333 (2001)"},{"key":"9100_CR29","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M. Vasquez","year":"2005","unstructured":"Vasquez, M., Vimont, Y.: Improved results on the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70\u201381 (2005)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9100-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-008-9100-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9100-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:30Z","timestamp":1559256870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-008-9100-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,26]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9100"],"URL":"https:\/\/doi.org\/10.1007\/s10732-008-9100-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,26]]}}}