{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:28:34Z","timestamp":1730273314896,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T00:00:00Z","timestamp":1669420800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T00:00:00Z","timestamp":1669420800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,26]]},"DOI":"10.1109\/iscmi56532.2022.10068488","type":"proceedings-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T19:49:06Z","timestamp":1679428146000},"page":"118-123","source":"Crossref","is-referenced-by-count":1,"title":["A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios"],"prefix":"10.1109","author":[{"given":"M\u00e9ziane","family":"A\u00efder","sequence":"first","affiliation":[{"name":"USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[{"name":"UPJV, EPROAD UR 4669,Amiens,France,80000"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khadidja","family":"Latram","sequence":"additional","affiliation":[{"name":"USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Game theory","year":"2004","author":"Maschler","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.2.407"},{"key":"ref3","first-page":"94","article-title":"A note on the max-min 0\u20131 knapsack problem","volume":"3","author":"Lida","year":"1999","journal-title":"Journal of Combinatorial Optimization"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/00207160701690433"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.10.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2011.00836.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.09.012"},{"key":"ref8","article-title":"Solving the multiple-scenario max-min knapsack problem exactly with column generation and branch-and-bound","author":"Pinto","year":"2015","journal-title":"Computers and Operations Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/codit.2016.7593588"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1504\/IJIEI.2018.091011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00463-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.beproc.2011.09.006","article-title":"New model of maximal covering location problem with fuzzy conditions","volume":"88","author":"Muro","year":"2011","journal-title":"Behavioural processes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.819096"}],"event":{"name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","start":{"date-parts":[[2022,11,26]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2022,11,27]]}},"container-title":["2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10068346\/10068435\/10068488.pdf?arnumber=10068488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T14:10:08Z","timestamp":1707833408000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10068488\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,26]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iscmi56532.2022.10068488","relation":{},"subject":[],"published":{"date-parts":[[2022,11,26]]}}}