{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:15Z","timestamp":1760708595794},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2013]]},"DOI":"10.1109\/access.2013.2273268","type":"journal-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T22:52:06Z","timestamp":1374706326000},"page":"475-479","source":"Crossref","is-referenced-by-count":15,"title":["A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem"],"prefix":"10.1109","volume":"1","author":[{"given":"P.","family":"Avella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Boccia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Vasilyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805722"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0036"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(96)00032-9"},{"key":"ref11","year":"2010","journal-title":"Using the CPLEX callable library"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00086-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017900606269"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0284-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/inte.9.4.12"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585725"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585726"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2003.814033"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0359-5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-011-9432-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.09.009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.5.758"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9125-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1100.0441"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.2.367"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9183-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0803038"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-007-9074-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/1055678031000107105"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0323"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","article-title":"Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems","volume":"97","author":"applegate","year":"2003","journal-title":"Math Program"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0174-V"},{"key":"ref22","first-page":"123","article-title":"A survey of the generalized assignment problem and its applications","volume":"43","author":"oncan","year":"2007","journal-title":"Inf Syst Operat Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.249.16075"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00576-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01720977"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2005.05.052"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580121"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/6336544\/06567888.pdf?arnumber=6567888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:33Z","timestamp":1642004673000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6567888\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2013.2273268","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}