{"id":"https://openalex.org/W2031400260","doi":"https://doi.org/10.1109/cec.2014.6900649","title":"A Lagrangian and surrogate information enhanced tabu search for the MMKP","display_name":"A Lagrangian and surrogate information enhanced tabu search for the MMKP","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2031400260","doi":"https://doi.org/10.1109/cec.2014.6900649","mag":"2031400260"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900649","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5041175372","display_name":"Skander Htiouech","orcid":"https://orcid.org/0000-0003-0520-2085"},"institutions":[{"id":"https://openalex.org/I4210131288","display_name":"National Engineering School of Tunis","ror":"https://ror.org/03b1zjt31","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210131288","https://openalex.org/I63596082"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Skander Htiouech","raw_affiliation_strings":["Sys-com National Engineering School of Tunis","Sys-com, National Engineering School of Tunis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sys-com National Engineering School of Tunis","institution_ids":["https://openalex.org/I4210131288"]},{"raw_affiliation_string":"Sys-com, National Engineering School of Tunis","institution_ids":["https://openalex.org/I4210131288"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072960507","display_name":"Sadok Bouamama","orcid":"https://orcid.org/0000-0002-3840-3978"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sadok Bouamama","raw_affiliation_strings":["HANA Lab. National School of Computer Science of Tunisia","HANA Lab., National School of Computer Science of Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HANA Lab. National School of Computer Science of Tunisia","institution_ids":[]},{"raw_affiliation_string":"HANA Lab., National School of Computer Science of Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3595,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77234513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1461","last_page":"1468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9884999990463257,"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/tabu-search","display_name":"Tabu search","score":0.8284286260604858},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8267917037010193},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7815921902656555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6381977796554565},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6275171041488647},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.6211226582527161},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5595213174819946},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5499189496040344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5394336581230164},{"id":"https://openalex.org/keywords/surrogate-model","display_name":"Surrogate model","score":0.4626958966255188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38336509466171265},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.19331058859825134}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8284286260604858},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8267917037010193},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7815921902656555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6381977796554565},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6275171041488647},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.6211226582527161},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5595213174819946},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5499189496040344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5394336581230164},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.4626958966255188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38336509466171265},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.19331058859825134},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900649","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","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":49,"referenced_works":["https://openalex.org/W59684277","https://openalex.org/W98156974","https://openalex.org/W142750658","https://openalex.org/W274164883","https://openalex.org/W1490182363","https://openalex.org/W1503898840","https://openalex.org/W1549861824","https://openalex.org/W1586409345","https://openalex.org/W1963547023","https://openalex.org/W1966474166","https://openalex.org/W1993814189","https://openalex.org/W2001973270","https://openalex.org/W2005305324","https://openalex.org/W2006738678","https://openalex.org/W2032107708","https://openalex.org/W2033971020","https://openalex.org/W2037230748","https://openalex.org/W2039844201","https://openalex.org/W2040332029","https://openalex.org/W2066635774","https://openalex.org/W2070759324","https://openalex.org/W2080988231","https://openalex.org/W2086168649","https://openalex.org/W2088429503","https://openalex.org/W2091599385","https://openalex.org/W2102019950","https://openalex.org/W2105339579","https://openalex.org/W2111231090","https://openalex.org/W2118627751","https://openalex.org/W2125987446","https://openalex.org/W2135814502","https://openalex.org/W2139211712","https://openalex.org/W2148819665","https://openalex.org/W2155756009","https://openalex.org/W2162727580","https://openalex.org/W2164855953","https://openalex.org/W2167750115","https://openalex.org/W2171590590","https://openalex.org/W2314634443","https://openalex.org/W2399219657","https://openalex.org/W3099649295","https://openalex.org/W4211231708","https://openalex.org/W4236127247","https://openalex.org/W4236384091","https://openalex.org/W4236605548","https://openalex.org/W4242130683","https://openalex.org/W4300190828","https://openalex.org/W6682951269","https://openalex.org/W6845012676"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W2616198151"],"abstract_inverted_index":{"The":[0,45],"multidimensional":[1],"multi-choice":[2],"knapsack":[3],"problem":[4],"(MMKP)":[5],"is":[6],"NP-hard.":[7],"Within":[8],"the":[9],"framework":[10],"of":[11,26,53],"solving":[12],"this":[13],"problem,":[14],"we":[15,40],"suggest":[16],"newer":[17,43],"approaches.":[18],"We":[19],"not":[20],"only":[21],"propose":[22],"a":[23],"multi-starts":[24],"version":[25],"our":[27,65],"previous":[28],"works":[29],"approach":[30],"using":[31],"surrogate":[32,54],"constraint":[33],"informations":[34,50],"based":[35],"choices":[36],"[31][32],":[37],"but":[38],"also":[39],"introduce":[41],"another":[42],"heuristic.":[44],"latter":[46],"uses":[47],"Lagrangian":[48],"relaxation":[49],"in":[51],"place":[52],"informations.":[55],"Compared":[56],"with":[57],"other":[58],"literature":[59],"known":[60],"methods":[61],"described":[62],"so":[63],"far,":[64],"approaches":[66],"experimentations":[67],"results":[68],"are":[69],"competitive.":[70]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}