{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T08:57:53Z","timestamp":1783501073364,"version":"3.55.0"},"reference-count":39,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1051\/ro\/2016049","type":"journal-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T06:34:36Z","timestamp":1469601276000},"page":"627-637","source":"Crossref","is-referenced-by-count":14,"title":["Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem"],"prefix":"10.1051","volume":"51","author":[{"given":"Mariem","family":"Ben Salem","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raouia","family":"Taktak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han\u00eane","family":"Ben Abdallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.cie.2011.01.019","volume":"60","author":"Akeb","year":"2011","journal-title":"Comput. Industrial Eng."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Th. Alves de Queiroz and F.K. Miyazawa, Approaches for the 2d 0-1 knapsack problem with conflict graphs. In Computing Conference (CLEI), 2013 XXXIX Latin American. IEEE (2013) 1\u20138.","DOI":"10.1109\/CLEI.2013.6670612"},{"key":"R3","unstructured":"A. Bettinelli, V. Cacchiani and E. Malaguti, Bounds and algorithms for the knapsack problem with conflict graph. Technical Report OR-14-16, DEIS\u2013University of Bologna, Bologna, Italy (2014)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2009.08.007","volume":"158","author":"Boussier","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"R5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02023001","volume":"41","author":"Crainic","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"R6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"key":"R7","unstructured":"Th. Alves de Queiroz and F. Keidi Miyazawa, Problema da mochila 0-1 bidimensional com restri\u00e7oes de disjun\u00e7ao (2012)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"Epstein","year":"2008","journal-title":"SIAM J. Optim."},{"key":"R9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s00236-007-0067-7","volume":"45","author":"Epstein","year":"2008","journal-title":"Acta Inf."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"Fr\u00e9ville","year":"2004","journal-title":"Europ. J. Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10479-005-3448-8","volume":"139","author":"Fr\u00e9ville","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"R12","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of np-completeness. San Francisco, LA: Freeman (1979)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"Gendreau","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"Glover","year":"1995","journal-title":"ORSA J. Comput."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna, Tabu search. Springer (1997).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"R18","unstructured":"F. Glover and A. Lokketangen, Probabilistic tabu search for zero-one mixed integer programming problems. University of Colorado, Boulder, USA (1994)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1026565712483","volume":"7","author":"Hanafi","year":"2001","journal-title":"J. Heuristics"},{"key":"R20","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","volume":"106","author":"Hanafi","year":"1998","journal-title":"Europ. J. Oper. Res."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1080\/0305215X.2013.819096","volume":"46","author":"Hifi","year":"2014","journal-title":"Engrg. Optim."},{"key":"R22","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"Hifi","year":"2006","journal-title":"J. Oper. Res. Soc."},{"key":"R23","doi-asserted-by":"crossref","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"Hifi","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"M. Hifi, S. Negre and M.Q.A. Mounir, Local branching-based algorithm for the disjunctively constrained knapsack problem. In CIE 2009 \u2013 International Conference on Computers & Industrial Engineering. IEEE (2009) 279\u2013284.","DOI":"10.1109\/ICCIE.2009.5223682"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"M. Hifi, S. Negre, T. Saadi, S. Saleh and L. Wu, A parallel large neighborhood search-based heuristic for the disjunctively constrained knapsack problem. In IPDPSW 2014: International Parallel & Distributed Processing Symposium Workshops. IEEE (2014) 1547\u20131551.","DOI":"10.1109\/IPDPSW.2014.173"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"M. Hifi and N. Otmani, A first level scatter search for disjunctively constrained knapsack problems. In International Conference on Communications, Computing and Control Applications (CCCA). IEEE (2011) 1\u20136.","DOI":"10.1109\/CCCA.2011.6031544"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1068969","DOI":"10.1080\/23311916.2015.1068969","volume":"2","author":"Hifi","year":"2015","journal-title":"Cogent Engrg."},{"key":"R28","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"Jansen","year":"1999","journal-title":"J. Combin. Optim."},{"key":"R29","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1016\/j.cor.2011.10.021","volume":"39","author":"Khanafer","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2010.01.037","volume":"206","author":"Khanafer","year":"2010","journal-title":"Europ. J. Oper. Res."},{"key":"R31","first-page":"1739","volume":"5","author":"Maiza","year":"2011","journal-title":"Appl. Math. Sci."},{"key":"R32","unstructured":"S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc. (1990)."},{"key":"R33","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"Pferschy","year":"2009","journal-title":"J. Graph Algorithms Appl."},{"key":"R34","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"Pisinger","year":"2007","journal-title":"INFORMS J. Comput."},{"key":"R35","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"Sadykov","year":"2013","journal-title":"INFORMS J. Comput."},{"key":"R36","unstructured":"A. Senisuka, B. You and T. Yamada, Reduction and exact algorithms for the disjunctively constrained knapsack problem. In: International symposium on operations research and its applications; ISORA\u201905. Lecture Notes in Operations Research (2005) 241\u2013254."},{"key":"R37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02125454","volume":"63","author":"Soriano","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"R38","first-page":"69","volume":"1","author":"Xu","year":"1996","journal-title":"Comb. Optim. Theory Practice"},{"key":"R39","unstructured":"Yamada T., Kataoka S. and Watanabe K., Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Inform. Process. Soc. Jpn. J. 43 (2002)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016049\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T22:07:48Z","timestamp":1656886068000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":39,"journal-issue":{"issue":"3"},"alternative-id":["ro160113"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2016049","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7]]}}}