{"id":"https://openalex.org/W1990862001","doi":"https://doi.org/10.1109/clei.2013.6670612","title":"Approaches for the 2D 0-1 knapsack problem with conflict graphs","display_name":"Approaches for the 2D 0-1 knapsack problem with conflict graphs","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W1990862001","doi":"https://doi.org/10.1109/clei.2013.6670612","mag":"1990862001"},"language":"en","primary_location":{"id":"doi:10.1109/clei.2013.6670612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei.2013.6670612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 XXXIX Latin American Computing Conference (CLEI)","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/A5037484451","display_name":"Thiago Alves de Queiroz","orcid":"https://orcid.org/0000-0003-2674-3366"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thiago Alves de Queiroz","raw_affiliation_strings":["Department of Mathematics, UFG-CAC, Catal\u00e3o-GO, Brazil","Dept. of Math., UFG-CAC, Catala\u0303o, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, UFG-CAC, Catal\u00e3o-GO, Brazil","institution_ids":[]},{"raw_affiliation_string":"Dept. of Math., UFG-CAC, Catala\u0303o, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040576989","display_name":"Fl\u00e1vio K. Miyazawa","orcid":"https://orcid.org/0000-0002-1067-6421"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Flavio Keidi Miyazawa","raw_affiliation_strings":["UNICAMP, Institute of Computing, Campinas-SP, Brazil","Inst. of Comput., UNICAMP, Campinas, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNICAMP, Institute of Computing, Campinas-SP, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"Inst. of Comput., UNICAMP, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.699,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74823433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"220","issue":null,"first_page":"1","last_page":"8"},"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.9975000023841858,"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.9866999983787537,"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.9349060654640198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7310296893119812},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7249362468719482},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7223371267318726},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.660336434841156},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.645366370677948},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6177499890327454},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5755859017372131},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5064634084701538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4899088740348816},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46534526348114014},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4185938835144043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3920431435108185},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3004695177078247},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.29717767238616943},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.24773746728897095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23337891697883606}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9349060654640198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7310296893119812},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7249362468719482},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7223371267318726},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.660336434841156},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.645366370677948},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6177499890327454},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5755859017372131},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5064634084701538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4899088740348816},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46534526348114014},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4185938835144043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3920431435108185},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3004695177078247},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29717767238616943},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.24773746728897095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23337891697883606},{"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/clei.2013.6670612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei.2013.6670612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 XXXIX Latin American Computing Conference (CLEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1973108067","https://openalex.org/W1976513369","https://openalex.org/W2005177364","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2028438572","https://openalex.org/W2037140854","https://openalex.org/W2048947076","https://openalex.org/W2049071849","https://openalex.org/W2060525068","https://openalex.org/W2074821977","https://openalex.org/W2077470163","https://openalex.org/W2084894096","https://openalex.org/W2088776663","https://openalex.org/W2089402478","https://openalex.org/W2109314481","https://openalex.org/W2111448234","https://openalex.org/W2140043891","https://openalex.org/W2159376627","https://openalex.org/W2555367514","https://openalex.org/W4206228784","https://openalex.org/W6672997692"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2169800510","https://openalex.org/W2993365626","https://openalex.org/W2087209118","https://openalex.org/W2889442766","https://openalex.org/W2393014972","https://openalex.org/W3171554204","https://openalex.org/W3199776955"],"abstract_inverted_index":{"This":[0,35],"work":[1,113],"deals":[2],"with":[3,98,116,135],"the":[4,43,127,139],"0-1":[5],"knapsack":[6],"problem":[7,36,46],"in":[8,31,42,48,111,129],"its":[9],"two-dimensional":[10,87],"variant,":[11],"when":[12],"there":[13],"is":[14,79],"a":[15,32,40,54,59,62,75,86,130],"conflict":[16],"graph":[17],"related":[18],"to":[19,70,137],"pairs":[20],"of":[21,89,104,126],"conflicting":[22],"items.":[23],"Conflicting":[24],"items":[25],"must":[26],"not":[27],"be":[28],"packed":[29],"together":[30],"same":[33],"bin.":[34],"also":[37,109],"arises":[38],"as":[39],"subproblem":[41],"bin":[44],"packing":[45,83],"and":[47,81,114],"supply":[49],"chain":[50],"scenarios.":[51],"We":[52],"propose":[53],"heuristic":[55,94,120],"that":[56,136],"generates":[57],"iteratively":[58],"solution":[60],"using":[61],"so":[63],"called":[64],"greedy":[65],"randomized":[66],"procedure.":[67],"In":[68],"order":[69],"avoid":[71],"local":[72],"optima":[73],"solutions,":[74],"penalization":[76],"memory":[77],"list":[78],"used,":[80],"several":[82],"strategies":[84],"under":[85],"grid":[88],"points":[90],"are":[91,96],"considered.":[92],"The":[93,119],"solutions":[95,123],"compared":[97,134],"those":[99],"ones":[100],"computed":[101],"by":[102],"means":[103],"an":[105],"integer":[106,140],"programming":[107],"model,":[108],"proposed":[110],"this":[112],"solved":[115],"CPLEX":[117],"solver.":[118],"got":[121],"optimal":[122],"for":[124],"75%":[125],"instances":[128],"lower":[131],"CPU":[132],"time":[133],"solve":[138],"model.":[141]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}