{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879376,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_34","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"396-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[]},{"given":"Sagvan","family":"Saleh","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"34_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"34_CR2","doi-asserted-by":"publisher","unstructured":"Hifi, M.: An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem. Eng. Optim. doi:10.1080\/0305215X.2013.819096 (Published online: 19 Sep 2013)","DOI":"10.1080\/0305215X.2013.819096"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"M Hifi","year":"2007","unstructured":"Hifi, M., Michrafy, M.: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Comput. Oper. Res. 34, 2657\u20132673 (2007)","journal-title":"Comput. Oper. Res."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"M Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M.: A reactive local search algorithm for the disjunctively constrained knapsack problem. J. Oper. Res. Soc. 57, 718\u2013726 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1504\/IJOR.2012.044026","volume":"13","author":"M Hifi","year":"2012","unstructured":"Hifi, M., Otmani, N.: An algorithm for the disjunctively constrained knapsack problem. Int. J. Oper. Res. 13, 22\u201343 (2012)","journal-title":"Int. J. Oper. Res."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Hifi, M., Otmani, N.: An algorithm for the disjunctively constrained knapsack problem. In: IEEE - International Conference on Communications, Computing and Control Applications, pp. 1\u20136 (2011)","DOI":"10.1109\/CCCA.2011.6031544"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Hifi, M., Negre, S., Ould Ahmed Mounir, M.: Local branching-based algorithm for the disjunctively constrained knapsack problem. In: IEEE Proceedings of the International Conference on Computers and Industrial Engineering, pp. 279\u2013284 (2009)","DOI":"10.1109\/ICCIE.2009.5223682"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manage. Sci. 45, 414\u2013424 (1999)","journal-title":"Manage. Sci."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13, 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput. 19, 36\u201351 (2007)","journal-title":"INFORMS J. Comput."},{"key":"34_CR11","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399\u2013419. Springer, New York (2010)"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"R Sadykov","year":"2013","unstructured":"Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J. Comput. 25(2), 244\u2013255 (2013)","journal-title":"INFORMS J. Comput."},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"34_CR14","first-page":"2864","volume":"43","author":"T Yamada","year":"2002","unstructured":"Yamada, T., Kataoka, S., Watanabe, K.: Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Inf. Process. Soc. Jap. J. 43, 2864\u20132870 (2002)","journal-title":"Inf. Process. Soc. Jap. J."},{"key":"34_CR15","unstructured":"Yamada, T., Kataoka, S.: Heuristic and exact algorithms for the disjunctively constrained knapsack problem. In: EURO 2001, Rotterdam, The Netherlands, pp. 9\u201311 (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T04:51:22Z","timestamp":1720759882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":15,"aliases":["10.1007\/978-3-319-14115-2_34"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}