{"id":"https://openalex.org/W2536466699","doi":"https://doi.org/10.1109/codit.2016.7593588","title":"A diversified method for the multi-scenarios max-min knapsack problem","display_name":"A diversified method for the multi-scenarios max-min knapsack problem","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2536466699","doi":"https://doi.org/10.1109/codit.2016.7593588","mag":"2536466699"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2016.7593588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020594351","display_name":"Thekra Al Douri","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thekra Al Douri","raw_affiliation_strings":["Universite de Picardie Jules Verne, Amiens, Hauts-de-France, FR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universite de Picardie Jules Verne, Amiens, Hauts-de-France, FR","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["Univercit\u00e9 de Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univercit\u00e9 de Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4247,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71767849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"355","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9805524349212646},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.8353654146194458},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7079916000366211},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7005710601806641},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6033411026000977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5824182033538818},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5787402391433716},{"id":"https://openalex.org/keywords/phase","display_name":"Phase (matter)","score":0.5647038817405701},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.41913244128227234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.308670312166214}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9805524349212646},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8353654146194458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7079916000366211},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7005710601806641},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6033411026000977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5824182033538818},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5787402391433716},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.5647038817405701},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.41913244128227234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.308670312166214},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2016.7593588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W1512733480","https://openalex.org/W1987669018","https://openalex.org/W2007851455","https://openalex.org/W2014354724","https://openalex.org/W2025706613","https://openalex.org/W2035820111","https://openalex.org/W2040319092","https://openalex.org/W2066671865","https://openalex.org/W2076163541","https://openalex.org/W2150560290","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2393014972","https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2169800510","https://openalex.org/W3171554204","https://openalex.org/W2037230748","https://openalex.org/W3199776955","https://openalex.org/W3112089036","https://openalex.org/W2167807475"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,40,45,54,85],"diversified":[6],"method":[7,17,81,116],"for":[8],"tackling":[9],"the":[10,24,28,33,75,92,103,108,114],"multi-scenarios":[11],"max-min":[12],"knapsack":[13],"problem.":[14],"The":[15,36,48,63,79,94,110],"proposed":[16,80,115],"is":[18,82],"based":[19],"on":[20,84],"three":[21],"phases:":[22],"(i)":[23],"building":[25],"phase,":[26],"(ii)":[27],"combination":[29],"phase":[30,38,50,65],"and":[31],"(iii)":[32],"exploring":[34],"phase.":[35],"first":[37],"yields":[39],"feasible":[41],"solution":[42,56],"by":[43,57,102],"using":[44],"greedy":[46],"procedure.":[47],"second":[49],"tries":[51,66],"to":[52,67,73,99],"provide":[53],"new":[55],"combining":[58],"subsets":[59],"of":[60,87],"starting":[61],"solutions.":[62],"third":[64],"make":[68],"an":[69],"intensification":[70],"in":[71,107],"order":[72],"improve":[74],"solutions":[76,119],"at":[77],"hand.":[78],"evaluated":[83],"set":[86],"benchmark":[88],"instances":[89],"taken":[90],"from":[91],"literature.":[93,109],"obtained":[95],"results":[96,111],"are":[97],"compared":[98],"those":[100,121],"reached":[101],"best":[104],"algorithms":[105],"available":[106],"show":[112],"that":[113],"provides":[117],"better":[118],"than":[120],"already":[122],"published.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}