{"id":"https://openalex.org/W1964762020","doi":"https://doi.org/10.1109/access.2013.2273268","title":"A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem","display_name":"A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1964762020","doi":"https://doi.org/10.1109/access.2013.2273268","mag":"1964762020"},"language":"en","primary_location":{"id":"doi:10.1109/access.2013.2273268","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2013.2273268","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6336544/06567888.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6336544/06567888.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053627768","display_name":"Pasquale Avella","orcid":"https://orcid.org/0000-0002-0462-3550"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Avella","raw_affiliation_strings":["Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy","Dipt. di Ing., Univ. del Sannio, Benevento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]},{"raw_affiliation_string":"Dipt. di Ing., Univ. del Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069880315","display_name":"Maurizio Boccia","orcid":"https://orcid.org/0000-0003-4947-9852"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Boccia","raw_affiliation_strings":["Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy","Dipt. di Ing., Univ. del Sannio, Benevento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]},{"raw_affiliation_string":"Dipt. di Ing., Univ. del Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103170688","display_name":"Igor Vasilyev","orcid":"https://orcid.org/0000-0003-1862-4586"},"institutions":[{"id":"https://openalex.org/I4210148533","display_name":"Institute for System Dynamics and Control Theory","ror":"https://ror.org/04wteqw51","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210127387","https://openalex.org/I4210148533","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"I. Vasilyev","raw_affiliation_strings":["Institute for System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, Lermontov, Russia","Inst. for Syst. Dynamics & Control Theor., Lermontov, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, Lermontov, Russia","institution_ids":["https://openalex.org/I4210148533"]},{"raw_affiliation_string":"Inst. for Syst. Dynamics & Control Theor., Lermontov, Russia","institution_ids":["https://openalex.org/I4210148533"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.0441,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86657412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"475","last_page":"479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980999827384949,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8973881006240845},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.7094647884368896},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7025832533836365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6644567251205444},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6285623908042908},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5650455951690674},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.546881377696991},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5129832625389099},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4986715316772461},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4829491972923279},{"id":"https://openalex.org/keywords/linear-bottleneck-assignment-problem","display_name":"Linear bottleneck assignment problem","score":0.4674787223339081},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45631182193756104},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.45161890983581543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41451090574264526},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2965080142021179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24747255444526672}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8973881006240845},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.7094647884368896},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7025832533836365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6644567251205444},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6285623908042908},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5650455951690674},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.546881377696991},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5129832625389099},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4986715316772461},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4829491972923279},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.4674787223339081},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45631182193756104},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.45161890983581543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41451090574264526},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2965080142021179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24747255444526672},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2013.2273268","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2013.2273268","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6336544/06567888.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ca2b5ac21a334a8e824bbdab9b4ab544","is_oa":true,"landing_page_url":"https://doaj.org/article/ca2b5ac21a334a8e824bbdab9b4ab544","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 1, Pp 475-479 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2013.2273268","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2013.2273268","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6336544/06567888.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1964762020.pdf","grobid_xml":"https://content.openalex.org/works/W1964762020.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1492685696","https://openalex.org/W1652378708","https://openalex.org/W1922855725","https://openalex.org/W1966693694","https://openalex.org/W1993062444","https://openalex.org/W2002338611","https://openalex.org/W2006346540","https://openalex.org/W2006934540","https://openalex.org/W2014617308","https://openalex.org/W2017019823","https://openalex.org/W2018596236","https://openalex.org/W2032982020","https://openalex.org/W2034186905","https://openalex.org/W2038095021","https://openalex.org/W2046228200","https://openalex.org/W2051496747","https://openalex.org/W2054174221","https://openalex.org/W2054299720","https://openalex.org/W2058233069","https://openalex.org/W2061568192","https://openalex.org/W2062718129","https://openalex.org/W2091502736","https://openalex.org/W2093737100","https://openalex.org/W2105349672","https://openalex.org/W2108203093","https://openalex.org/W2116567050","https://openalex.org/W2117522563","https://openalex.org/W2119790020","https://openalex.org/W2135219659","https://openalex.org/W2141260249","https://openalex.org/W2155078398","https://openalex.org/W2163936975","https://openalex.org/W4256642141","https://openalex.org/W6677995188"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W2113934189","https://openalex.org/W2011647332","https://openalex.org/W1586515950","https://openalex.org/W1560792291","https://openalex.org/W3149825000","https://openalex.org/W4212780071","https://openalex.org/W4287244800","https://openalex.org/W2760584304","https://openalex.org/W2382974548"],"abstract_inverted_index":{"The":[0,45],"multilevel":[1],"generalized":[2,64],"assignment":[3,10,65],"problem":[4],"(MGAP)":[5],"consists":[6],"of":[7,12,15,42,52,61,112,120],"minimizing":[8],"the":[9,50,62,93,99,118,121],"cost":[11],"a":[13,23,30,57,68,82,110],"set":[14,111],"jobs":[16],"to":[17],"machines,":[18],"each":[19,75],"having":[20],"associated":[21,73],"therewith":[22],"capacity":[24,100],"constraint.":[25],"Each":[26],"machine":[27],"can":[28],"perform":[29],"job":[31],"with":[32,74],"different":[33,38],"efficiency":[34,70],"levels":[35],"that":[36],"entail":[37],"costs":[39],"and":[40,102],"amount":[41],"resources":[43],"required.":[44],"MGAP":[46],"was":[47],"introduced":[48],"in":[49],"context":[51],"large":[53],"manufacturing":[54],"systems":[55],"as":[56],"more":[58],"general":[59],"variant":[60],"well-known":[63],"problem,":[66],"where":[67],"single":[69],"level":[71],"is":[72,87,115],"machine.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80],"propose":[81],"branch-and-cut":[83],"algorithm":[84],"whose":[85],"core":[86],"an":[88],"exact":[89],"separation":[90],"procedure":[91],"for":[92],"multiple-choice":[94],"knapsack":[95],"polytope":[96],"induced":[97],"by":[98],"constraints":[101],"single-level":[103],"execution":[104],"constraints.":[105],"A":[106],"computational":[107],"experience":[108],"on":[109],"benchmark":[113],"instances":[114],"reported,":[116],"showing":[117],"effectiveness":[119],"proposed":[122],"approach.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}