乐胖代购免代理版

{"id":"https://openalex.org/W3128148487","doi":"https://doi.org/10.1142/s021759592150010x","title":"A Fast Algorithm for Knapsack Problem with Conflict Graph","display_name":"A Fast Algorithm for Knapsack Problem with Conflict Graph","publication_year":2021,"publication_date":"2021-02-10","ids":{"openalex":"https://openalex.org/W3128148487","doi":"https://doi.org/10.1142/s021759592150010x","mag":"3128148487"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021759592150010x","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5100343414","display_name":"Jiaxin Li","orcid":"https://orcid.org/0000-0002-5316-8144"},"institutions":[{"id":"https://openalex.org/I27357992","display_name":"Dalian University of Technology","ror":"https://ror.org/023hj5876","country_code":"CN","type":"funder","lineage":["https://openalex.org/I27357992"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaxin Li","raw_affiliation_strings":["Software School, Dalian University of Technology, Dalian, P. R. China"],"affiliations":[{"raw_affiliation_string":"Software School, Dalian University of Technology, Dalian, P. R. China","institution_ids":["https://openalex.org/I27357992"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100306850","display_name":"Lan Yan","orcid":"https://orcid.org/0000-0001-6452-9649"},"institutions":[{"id":"https://openalex.org/I61565387","display_name":"Dalian Minzu University","ror":"https://ror.org/02hxfx521","country_code":"CN","type":"funder","lineage":["https://openalex.org/I61565387"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Lan","raw_affiliation_strings":["Dalian Minzu University, Dalian, P. R. China"],"affiliations":[{"raw_affiliation_string":"Dalian Minzu University, Dalian, P. R. China","institution_ids":["https://openalex.org/I61565387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100352729","display_name":"Feng Chen","orcid":"https://orcid.org/0000-0002-9493-4976"},"institutions":[{"id":"https://openalex.org/I66943878","display_name":"De Montfort University","ror":"https://ror.org/0312pnr83","country_code":"GB","type":"funder","lineage":["https://openalex.org/I66943878"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Feng Chen","raw_affiliation_strings":["Software Technology Research Laboratory, De Montfort University, UK"],"affiliations":[{"raw_affiliation_string":"Software Technology Research Laboratory, De Montfort University, UK","institution_ids":["https://openalex.org/I66943878"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100620298","display_name":"Xin Han","orcid":"https://orcid.org/0000-0001-6430-9638"},"institutions":[{"id":"https://openalex.org/I27357992","display_name":"Dalian University of Technology","ror":"https://ror.org/023hj5876","country_code":"CN","type":"funder","lineage":["https://openalex.org/I27357992"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xin Han","raw_affiliation_strings":["Software School, Dalian University of Technology, Dalian, P. R. China"],"affiliations":[{"raw_affiliation_string":"Software School, Dalian University of Technology, Dalian, P. R. China","institution_ids":["https://openalex.org/I27357992"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024504556","display_name":"Jacek B\u0142a\u017cewicz","orcid":"https://orcid.org/0000-0001-8326-1094"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"funder","lineage":["https://openalex.org/I46597724"]},{"id":"https://openalex.org/I4210152414","display_name":"Institute of Bioorganic Chemistry, Polish Academy of Sciences","ror":"https://ror.org/04ejdtr48","country_code":"PL","type":"funder","lineage":["https://openalex.org/I4210152414","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jacek Blazewicz","raw_affiliation_strings":["European Center for Bioinformatics and Genomics, Pozna\u0144, Poland","Institute of Bioorganic Chemistry, Polish Academy of Sciences, Pozna\u0144, Poland","Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I46597724"]},{"raw_affiliation_string":"Institute of Bioorganic Chemistry, Polish Academy of Sciences, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I4210152414"]},{"raw_affiliation_string":"European Center for Bioinformatics and Genomics, Pozna\u0144, Poland","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100620298"],"corresponding_institution_ids":["https://openalex.org/I27357992"],"apc_list":null,"apc_paid":null,"fwci":0.407,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.636485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":75,"max":78},"biblio":{"volume":"38","issue":"06","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9999,"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.9999,"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/T12288","display_name":"Optimization and Search Problems","score":0.999,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9982,"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/branch-and-bound","display_name":"Branch and bound","score":0.46370465}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9398414},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.532634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5312566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5089214},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47953868},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47339094},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46370465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3635862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32873863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21169189},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021759592150010x","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China","award_id":"11701062"},{"funder":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China","award_id":"11971091"},{"funder":"https://openalex.org/F4320323086","funder_display_name":"Natural Science Foundation of Liaoning Province","award_id":"2020-BS-076"},{"funder":"https://openalex.org/F4320323086","funder_display_name":"Natural Science Foundation of Liaoning Province","award_id":"2019-MS-062"}],"datasets":[],"versions":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1973108067","https://openalex.org/W1979423668","https://openalex.org/W2000840218","https://openalex.org/W2013067314","https://openalex.org/W2037140854","https://openalex.org/W2084894096","https://openalex.org/W2103159428","https://openalex.org/W2140043891","https://openalex.org/W2149454052","https://openalex.org/W2401610261","https://openalex.org/W2555367514","https://openalex.org/W2620796999","https://openalex.org/W2790214862","https://openalex.org/W4232585008","https://openalex.org/W4233565207"],"related_works":["https://openalex.org/W3169691842","https://openalex.org/W246960280","https://openalex.org/W2381035939","https://openalex.org/W2378557713","https://openalex.org/W2168163332","https://openalex.org/W2141701778","https://openalex.org/W2089402478","https://openalex.org/W2087209118","https://openalex.org/W2005493932","https://openalex.org/W179363847"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,10,150],"fast":[6],"algorithm":[7,12,96,101,111,134,139,148],"based":[8,97,135],"on":[9,66,98,112,136],"new":[11,100,138],"to":[13,51,61,92,124],"calculate":[14],"the":[15,19,32,41,59,63,67,71,75,84,94,99,109,132,137,146],"upper":[16],"bound":[17],"for":[18,83,126],"knapsack":[20,34,60],"problem":[21],"with":[22,86],"conflict":[23,38],"graph":[24,39,85],"(KPCG).":[25],"The":[26,48,78],"KPCG":[27],"is":[28,50,102],"an":[29],"extension":[30],"of":[31,46,69,122],"0-1":[33],"problem.":[35],"A":[36],"pre-defined":[37],"defines":[40],"incompatibility":[42,76],"properties":[43],"between":[44],"pairs":[45],"items.":[47],"goal":[49],"determine":[52],"which":[53],"items":[54],"should":[55],"be":[56],"packed":[57],"into":[58],"maximize":[62],"total":[64],"profit":[65],"premise":[68],"satisfying":[70],"capacity":[72],"constraint":[73],"and":[74,104,114,118],"constraints.":[77],"experimental":[79],"results":[80],"show":[81],"that":[82],"density":[87,129],"greater":[88],"than":[89,108,145],"or":[90],"equal":[91],"0.1,":[93],"branch-and-bound":[95,133],"1.6458":[103],"1.6352":[105],"times":[106],"faster":[107],"state-of-the-art":[110,147],"random":[113],"correlated":[115],"instances,":[116],"respectively,":[117],"can":[119,140],"achieve":[120],"speedups":[121],"up":[123],"4.6477":[125],"some":[127],"low":[128],"instances.":[130],"Moreover,":[131],"optimally":[141],"solve":[142],"more":[143],"instances":[144],"in":[149],"given":[151],"time":[152],"limit.":[153]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3128148487","counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2025-02-22T20:13:08.124294","created_date":"2021-02-15"}