{"id":"https://openalex.org/W1492729476","doi":"https://doi.org/10.1109/hpcsim.2015.7237081","title":"A four-decomposition strategies for hierarchically modeling combinatorial optimization problems: framework, conditions and relations","display_name":"A four-decomposition strategies for hierarchically modeling combinatorial optimization problems: framework, conditions and relations","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W1492729476","doi":"https://doi.org/10.1109/hpcsim.2015.7237081","mag":"1492729476"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2015.7237081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2015.7237081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on High Performance Computing & Simulation (HPCS)","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/A5083873296","display_name":"Marouene Chaieb","orcid":"https://orcid.org/0000-0002-1503-1083"},"institutions":[{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]},{"id":"https://openalex.org/I4210140729","display_name":"Institut Sup\u00e9rieur de Gestion de Tunis","ror":"https://ror.org/04w9mdw91","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496","https://openalex.org/I4210140729"]}],"countries":["FR","TN"],"is_corresponding":true,"raw_author_name":"Marouene Chaieb","raw_affiliation_strings":["LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie"],"affiliations":[{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","institution_ids":["https://openalex.org/I237446400"]},{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie","institution_ids":["https://openalex.org/I237446400","https://openalex.org/I4210140729"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003172408","display_name":"Jaber Jemai","orcid":"https://orcid.org/0000-0003-2363-1625"},"institutions":[{"id":"https://openalex.org/I4210140729","display_name":"Institut Sup\u00e9rieur de Gestion de Tunis","ror":"https://ror.org/04w9mdw91","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496","https://openalex.org/I4210140729"]},{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR","TN"],"is_corresponding":false,"raw_author_name":"Jaber Jemai","raw_affiliation_strings":["LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie"],"affiliations":[{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","institution_ids":["https://openalex.org/I237446400"]},{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie","institution_ids":["https://openalex.org/I237446400","https://openalex.org/I4210140729"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105354064","display_name":"Khaled Mellouli","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140729","display_name":"Institut Sup\u00e9rieur de Gestion de Tunis","ror":"https://ror.org/04w9mdw91","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496","https://openalex.org/I4210140729"]},{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR","TN"],"is_corresponding":false,"raw_author_name":"Khaled Mellouli","raw_affiliation_strings":["LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie"],"affiliations":[{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de, Le Bardo, Tunisie","institution_ids":["https://openalex.org/I237446400"]},{"raw_affiliation_string":"LARODEC Institut Sup\u00e9rieur de Gestion de Tunis, 41 rue de la libert\u00e9, Le Bardo, 2000, Tunisie","institution_ids":["https://openalex.org/I237446400","https://openalex.org/I4210140729"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083873296"],"corresponding_institution_ids":["https://openalex.org/I237446400","https://openalex.org/I4210140729"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04228958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"24","issue":null,"first_page":"491","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11729","display_name":"Product Development and Customization","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11729","display_name":"Product Development and Customization","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9688000082969666,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9664000272750854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.8053711652755737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.686335563659668},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6443992853164673},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5586851239204407},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5410413146018982},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5116105675697327},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5098273158073425},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.49632149934768677},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37824398279190063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23162949085235596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19899678230285645}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.8053711652755737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.686335563659668},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6443992853164673},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5586851239204407},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5410413146018982},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5116105675697327},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5098273158073425},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.49632149934768677},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37824398279190063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23162949085235596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19899678230285645},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2015.7237081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2015.7237081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on High Performance Computing & Simulation (HPCS)","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":19,"referenced_works":["https://openalex.org/W44356110","https://openalex.org/W113945109","https://openalex.org/W1520138077","https://openalex.org/W1891053194","https://openalex.org/W1971985512","https://openalex.org/W1976184158","https://openalex.org/W1997384914","https://openalex.org/W2009683816","https://openalex.org/W2022883048","https://openalex.org/W2030203254","https://openalex.org/W2050784217","https://openalex.org/W2079109527","https://openalex.org/W2105560970","https://openalex.org/W2145814658","https://openalex.org/W2158874658","https://openalex.org/W4247550992","https://openalex.org/W4285719527","https://openalex.org/W6601815256","https://openalex.org/W6639498780"],"related_works":["https://openalex.org/W2330487432","https://openalex.org/W2153629319","https://openalex.org/W2104316494","https://openalex.org/W239705756","https://openalex.org/W156119379","https://openalex.org/W2082139080","https://openalex.org/W2474680198","https://openalex.org/W4231015910","https://openalex.org/W2364847091","https://openalex.org/W1547852488"],"abstract_inverted_index":{"We":[0,75],"address":[1],"the":[2,26,35,40,47,64,121,136,170,186],"problem":[3,45],"of":[4,140,161,172],"modeling":[5,20,37,141],"combinatorial":[6,130],"optimization":[7,73,88,154],"problems":[8,14,131,142,147],"(COP).":[9],"COPs":[10,61],"are":[11],"generally":[12],"complex":[13],"to":[15,24,33,42,68,77,85,184],"solve.":[16],"So":[17],"a":[18,55,79,152,159],"good":[19],"step":[21],"is":[22],"fundamental":[23],"make":[25],"solution":[27],"easier.":[28],"Our":[29],"approach":[30,57],"orients":[31],"researches":[32],"choose":[34],"best":[36],"strategy":[38],"from":[39,120,135],"beginning":[41],"avoid":[43],"any":[44],"in":[46],"solving":[48],"process.":[49],"This":[50],"paper":[51],"aims":[52],"at":[53],"proposing":[54],"new":[56],"dealing":[58],"with":[59],"hard":[60],"particularly":[62],"when":[63],"decomposition":[65,97,108],"process":[66],"leads":[67],"some":[69],"well-known":[70],"and":[71,109,138,177],"canonical":[72],"sub-problems.":[74],"tried":[76],"draw":[78],"clear":[80],"framework":[81,91],"that":[82],"will":[83,92],"help":[84],"model":[86],"hierarchical":[87,153],"problems.":[89],"The":[90],"be":[93,133,149,182],"composed":[94],"by":[95],"four":[96],"strategies":[98],"which":[99],"are:":[100],"objective":[101],"based":[102,105],"decomposition;":[103],"constraints":[104],"decomposition,":[106],"semantic":[107],"data":[110],"partitioning":[111],"strategy.":[112],"For":[113],"each":[114],"strategy,":[115],"we":[116,157,168],"present":[117],"supporting":[118],"examples":[119],"literature":[122],"where":[123],"it":[124],"was":[125],"applied.":[126],"But,":[127],"not":[128],"all":[129],"can":[132,148,181],"benefit":[134],"outcomes":[137],"benefits":[139],"hierarchically,":[143],"rather":[144],"only":[145],"particular":[146],"modeled":[150],"like":[151],"problem.":[155],"Thus,":[156],"propose":[158],"set":[160],"decomposability":[162],"conditions":[163],"for":[164],"decomposing":[165],"COPs.":[166],"Furthermore,":[167],"define":[169],"types":[171],"relationships":[173],"between":[174],"obtained":[175],"sub-problems":[176],"how":[178],"partial":[179],"solutions":[180],"merged":[183],"obtain":[185],"final":[187],"solution.":[188]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}