{"id":"https://openalex.org/W2321898977","doi":"https://doi.org/10.1109/codit.2014.6996879","title":"An exact solution search for the max-min multiple knapsack problem","display_name":"An exact solution search for the max-min multiple knapsack problem","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2321898977","doi":"https://doi.org/10.1109/codit.2014.6996879","mag":"2321898977"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2014.6996879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"article","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/A5031874788","display_name":"Ferhan Al\u2010Maliky","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":"Ferhan Al-Maliky","raw_affiliation_strings":["Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","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":["Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066348607","display_name":"Hedi Mhalla","orcid":"https://orcid.org/0000-0001-7434-8956"},"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":"Hedi Mhalla","raw_affiliation_strings":["Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire EPROAD - EA 4669, Universit\u00e9 de Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.28897661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"101","issue":null,"first_page":"117","last_page":"122"},"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.9919000267982483,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9646000266075134,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9459793567657471},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7347807288169861},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6634779572486877},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5905739665031433},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5672178268432617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5661342740058899},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5555362701416016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5517456531524658},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.49233758449554443},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4345667362213135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35832083225250244},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33872494101524353}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9459793567657471},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7347807288169861},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6634779572486877},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5905739665031433},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5672178268432617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5661342740058899},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5555362701416016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5517456531524658},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.49233758449554443},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4345667362213135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35832083225250244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33872494101524353},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2014.6996879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1608777039","https://openalex.org/W1968512292","https://openalex.org/W1972746086","https://openalex.org/W1985289934","https://openalex.org/W2011039300","https://openalex.org/W2015348119","https://openalex.org/W2021328726","https://openalex.org/W2031498611","https://openalex.org/W2045768377","https://openalex.org/W2084894096","https://openalex.org/W2105175235","https://openalex.org/W2188767906","https://openalex.org/W2403558388","https://openalex.org/W6636571244","https://openalex.org/W6713180670"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W4394849239","https://openalex.org/W2182290077"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"to":[5,31,38,88,133],"solve":[6],"the":[7,21,40,43,91,104,122,125,137,143,149],"max-min":[8],"multiple":[9],"knapsack":[10],"problem":[11,22],"by":[12,25,80,96,136],"using":[13,97],"an":[14,70],"exact":[15,145],"solution":[16],"search.":[17],"An":[18],"instance":[19],"of":[20,28,42,52,85,103,112,117,124,142],"is":[23,58,78,94,107],"defined":[24],"a":[26,50,61,66,98,110,115],"set":[27,111],"n":[29],"items":[30,87],"be":[32],"packed":[33],"into":[34],"m":[35],"knapsacks":[36],"as":[37,65],"maximize":[39],"minimum":[41],"knapsacks'":[44],"profits.":[45],"The":[46,74,101],"proposed":[47,105,126],"method":[48,106,127,146],"uses":[49],"series":[51],"interval":[53,57],"searches,":[54],"where":[55],"each":[56],"bounded":[59],"with":[60],"target":[62,75],"value":[63],"(considered":[64],"lower":[67,76],"bound)":[68],"and":[69,140],"estimated":[71],"upper":[72,92],"bound.":[73],"bound":[77,93],"computed":[79,95],"applying":[81],"some":[82,86],"aggressive":[83],"fixation":[84],"optimality":[89],"whereas":[90],"surrogate":[99],"relaxation.":[100],"performance":[102],"evaluated":[108],"on":[109],"instances":[113],"containing":[114],"variety":[116],"sizes.":[118],"Computational":[119],"results":[120,132],"showed":[121],"superiority":[123],"when":[128],"comparing":[129],"its":[130],"provided":[131],"those":[134],"obtained":[135],"Cplex":[138],"solver":[139],"one":[141],"best":[144],"available":[147],"in":[148],"literature.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}