{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:49Z","timestamp":1750307509725,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2009,7,8]]},"DOI":"10.1145\/1569901.1570236","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"1919-1920","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Interval island model initialization for permutation-based problems"],"prefix":"10.1145","author":[{"given":"Malika","family":"Mehdi","sequence":"first","affiliation":[{"name":"Luxembourg University \/INRIA Futurs , Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[{"name":"INRIA Futurs , Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[{"name":"INRIA Futurs, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[{"name":"Luxembourg University , Luxembourg, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.014"},{"key":"e_1_3_2_1_2_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 N.","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. , Long Beach, California , March 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., Long Beach, California, March 2007."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570236","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1570236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:59Z","timestamp":1750249079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":2,"alternative-id":["10.1145\/1569901.1570236","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1570236","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}