{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:21:52Z","timestamp":1761895312258,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T00:00:00Z","timestamp":1310428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,12]]},"DOI":"10.1145\/2001576.2001647","type":"proceedings-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T12:25:09Z","timestamp":1310732709000},"page":"513-520","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems."],"prefix":"10.1145","author":[{"given":"Malika","family":"Mehdi","sequence":"first","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Charr","sequence":"additional","affiliation":[{"name":"INRIA Lille Nord-Europe, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[{"name":"INRIA Lille Nord-Europe, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[{"name":"INRIA Lille Nord-Europe, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026900.92269.ec"},{"key":"e_1_3_2_1_3_1","first-page":"136","volume-title":"Lecture Notes In Computer Science","volume":"4926","author":"J.-L.","year":"2008","unstructured":"J.-L. B. Cedric Pessan and E. Neron. Genetic branch-and-bound or exact genetic algorithm ? In Lecture Notes In Computer Science , volume 4926 , pages 136 -- 147 , 2008 . J.-L. B. Cedric Pessan and E. Neron. Genetic branch-and-bound or exact genetic algorithm? In Lecture Notes In Computer Science, volume 4926, pages 136--147, 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2006.1652188"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011921025322"},{"key":"e_1_3_2_1_6_1","volume-title":"The 21st Conference of the European Chapter on Combinatorial Optimization","author":"Galea F.","year":"2008","unstructured":"F. Galea , P. Hahn , and B. LeCun . A parallel implementation of the quadratic three-dimensional assignment problem using the Bob++ framework . The 21st Conference of the European Chapter on Combinatorial Optimization , 2008 . F. Galea, P. Hahn, and B. LeCun. A parallel implementation of the quadratic three-dimensional assignment problem using the Bob++ framework. The 21st Conference of the European Chapter on Combinatorial Optimization, 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883266"},{"key":"e_1_3_2_1_8_1","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D.","year":"1989","unstructured":"D. Goldberg . Genetic Algorithms in Search, Optimization, and Machine Learning . Addison-Wesley , 1989 . D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989."},{"key":"e_1_3_2_1_9_1","first-page":"154","volume-title":"Proceedings of the First International Conference on Genetic Algorithms and their Applications","author":"Goldberg D.","year":"1985","unstructured":"D. Goldberg and R. Lingle . Alleles, loci, and the traveling salesman problem . In Proceedings of the First International Conference on Genetic Algorithms and their Applications , pages 154 -- 159 , Cambridge , 1985 . D. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of the First International Conference on Genetic Algorithms and their Applications, pages 154--159, Cambridge, 1985."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.014"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.035"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586526"},{"key":"e_1_3_2_1_15_1","volume-title":"Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp.","author":"Mezmaz M.","year":"2007","unstructured":"M. Mezmaz , N. Melab , and E.- G. Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp. , 2007 . M. Mezmaz, N. Melab, and E.-G. Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp., 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499305_5"},{"key":"e_1_3_2_1_17_1","volume-title":"Pro. of the 6th Metaheuristics Int. Conf.","author":"Puchinger J.","year":"2005","unstructured":"J. Puchinger , G. R. Raidl , and M. Gruber . Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem . In Pro. of the 6th Metaheuristics Int. Conf. , 2005 . J. Puchinger, G. R. Raidl, and M. Gruber. Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. In Pro. of the 6th Metaheuristics Int. Conf., 2005."}],"event":{"name":"GECCO '11: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Dublin Ireland","acronym":"GECCO '11"},"container-title":["Proceedings of the 13th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001576.2001647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:20Z","timestamp":1750244780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,12]]},"references-count":16,"alternative-id":["10.1145\/2001576.2001647","10.1145\/2001576"],"URL":"https:\/\/doi.org\/10.1145\/2001576.2001647","relation":{},"subject":[],"published":{"date-parts":[[2011,7,12]]},"assertion":[{"value":"2011-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}