乐胖代购免代理版

{"id":"https://openalex.org/W2091971915","doi":"https://doi.org/10.1287/ijoc.7.1.109","title":"A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems","display_name":"A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2091971915","doi":"https://doi.org/10.1287/ijoc.7.1.109","mag":"2091971915"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.7.1.109","pdf_url":null,"source":{"id":"https://openalex.org/S4210237176","display_name":"INFORMS Journal on Computing","issn_l":"0899-1499","issn":["0899-1499","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"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/A5024890889","display_name":"Kurt M. Bretthauer","orcid":"https://orcid.org/0000-0002-7785-750X"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"funder","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kurt M. Bretthauer","raw_affiliation_strings":["Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843"],"affiliations":[{"raw_affiliation_string":"Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016033028","display_name":"Bala Shetty","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"funder","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bala Shetty","raw_affiliation_strings":["Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843"],"affiliations":[{"raw_affiliation_string":"Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060647133","display_name":"Siddhartha S. Syam","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"funder","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha Syam","raw_affiliation_strings":["Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843"],"affiliations":[{"raw_affiliation_string":"Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843","institution_ids":["https://openalex.org/I91045830"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.537,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.968098,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":92},"biblio":{"volume":"7","issue":"1","first_page":"109","last_page":"116"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9992,"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.9992,"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.9943,"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.9933,"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/change-making-problem","display_name":"Change-making problem","score":0.70785713},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.623887},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.44057786}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.94942474},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.70785713},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6861781},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6827617},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.623887},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6074517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56089467},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.55032086},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5307004},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5180909},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49247584},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.44057786},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.42297032},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.42146555},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4155544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34931052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34001654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3163575},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.7.1.109","pdf_url":null,"source":{"id":"https://openalex.org/S4210237176","display_name":"INFORMS Journal on Computing","issn_l":"0899-1499","issn":["0899-1499","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4206938479","https://openalex.org/W3197632753","https://openalex.org/W3047701705","https://openalex.org/W3032701465","https://openalex.org/W2380301735","https://openalex.org/W2091971915","https://openalex.org/W2046300504","https://openalex.org/W2015560140","https://openalex.org/W2013441581","https://openalex.org/W2008507270"],"abstract_inverted_index":{"We":[0,37],"present":[1],"a":[2,26],"branch":[3],"and":[4,16],"bound":[5],"algorithm":[6,24],"for":[7,42,50],"solving":[8,44],"separable":[9],"convex":[10],"quadratic":[11,30],"knapsack":[12,31],"problems":[13,32,51],"with":[14,52],"lower":[15],"upper":[17],"bounds":[18],"on":[19,62,71],"the":[20,45],"integer":[21,56],"variables.":[22],"The":[23],"solves":[25],"series":[27],"of":[28],"continuous":[29,46],"via":[33],"their":[34],"Kuhn-Tucker":[35],"conditions.":[36],"also":[38],"discuss":[39],"reoptimization":[40],"procedures":[41],"efficiently":[43],"subproblems.":[47],"Computational":[48],"results":[49],"up":[53],"to":[54,75],"300":[55],"variables":[57],"are":[58],"reported.":[59],"INFORMS":[60],"Journal":[61,70],"Computing,":[63],"ISSN":[64,78],"1091-9856,":[65],"was":[66],"published":[67],"as":[68],"ORSA":[69],"Computing":[72],"from":[73],"1989":[74],"1995":[76],"under":[77],"0899-1499.":[79]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2091971915","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-03-16T13:20:54.170759","created_date":"2016-06-24"}