{"id":"https://openalex.org/W2050146290","doi":"https://doi.org/10.1080/00207160412331290667","title":"Algorithms to solve the knapsack constrained maximum spanning tree problem","display_name":"Algorithms to solve the knapsack constrained maximum spanning tree problem","publication_year":2004,"publication_date":"2004-12-13","ids":{"openalex":"https://openalex.org/W2050146290","doi":"https://doi.org/10.1080/00207160412331290667","mag":"2050146290"},"language":"en","primary_location":{"id":"doi:10.1080/00207160412331290667","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331290667","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5106263487","display_name":"Takeo Yamada","orcid":"https://orcid.org/0000-0002-7506-5154"},"institutions":[{"id":"https://openalex.org/I443798","display_name":"National Defense Academy of Japan","ror":"https://ror.org/05xszy717","country_code":"JP","type":"education","lineage":["https://openalex.org/I443798"]},{"id":"https://openalex.org/I4210161658","display_name":"Russian State Agrarian Correspondence University","ror":"https://ror.org/0548hz093","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210161658"]}],"countries":["JP","RU"],"is_corresponding":true,"raw_author_name":"Takeo Yamada","raw_affiliation_strings":["Correspondenceyamada@nda.ac.jp","National Defense Academy of JAPAN"],"affiliations":[{"raw_affiliation_string":"Correspondenceyamada@nda.ac.jp","institution_ids":["https://openalex.org/I4210161658"]},{"raw_affiliation_string":"National Defense Academy of JAPAN","institution_ids":["https://openalex.org/I443798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070748497","display_name":"Kohtaro Watanabe","orcid":"https://orcid.org/0000-0001-9674-0924"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kohtaro Watanabe","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000863924","display_name":"Seiji Kataoka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seiji Kataoka","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5106263487"],"corresponding_institution_ids":["https://openalex.org/I4210161658","https://openalex.org/I443798"],"apc_list":null,"apc_paid":null,"fwci":0.8391,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.78205659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"82","issue":"1","first_page":"23","last_page":"34"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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.9865000247955322,"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.859636664390564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7163447737693787},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.582874596118927},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5580995678901672},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5437045097351074},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.48811373114585876},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45216405391693115},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3233475685119629}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.859636664390564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7163447737693787},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.582874596118927},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5580995678901672},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5437045097351074},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.48811373114585876},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45216405391693115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3233475685119629}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207160412331290667","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331290667","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.1487","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.1487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nda.ac.jp/~yamada/paper/05-2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W1499020692","https://openalex.org/W1965680834","https://openalex.org/W1968143987","https://openalex.org/W1968569154","https://openalex.org/W1976720680","https://openalex.org/W1977545325","https://openalex.org/W1984407615","https://openalex.org/W2007563254","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2045768377","https://openalex.org/W2066671865","https://openalex.org/W2072803231","https://openalex.org/W2087216833","https://openalex.org/W2106371135","https://openalex.org/W2107705503","https://openalex.org/W2324459587","https://openalex.org/W2336259629","https://openalex.org/W2505968561","https://openalex.org/W2986989272","https://openalex.org/W2998757566","https://openalex.org/W4213060235","https://openalex.org/W4232951231","https://openalex.org/W4285719527","https://openalex.org/W4300005723"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2089402478"],"abstract_inverted_index":{"The":[0,54],"knapsack":[1,34,60],"problem":[2,8,55,76,90],"and":[3,15,52,80,93],"the":[4,59,68,89,103],"minimum":[5],"spanning":[6,64],"tree":[7,65,69],"are":[9,19,31],"both":[10],"fundamental":[11],"in":[12],"operations":[13],"research":[14],"computer":[16],"science.":[17],"We":[18,73,101],"concerned":[20],"with":[21,50,61],"a":[22,33,36,62,84,95,107],"combination":[23],"of":[24,35,109,115],"these":[25],"two":[26],"problems.":[27,117],"That":[28],"is,":[29],"we":[30],"given":[32],"fixed":[37],"capacity,":[38],"as":[39,41],"well":[40],"an":[42],"undirected":[43],"graph":[44],"where":[45],"each":[46],"edge":[47],"is":[48,56,71],"associated":[49],"profit":[51,70],"weight.":[53],"to":[57,87,91,98],"fill":[58],"feasible":[63],"such":[66],"that":[67],"maximized.":[72],"prove":[74],"this":[75],"\ud835\udca9\ud835\udcab-hard,":[77],"present":[78],"upper":[79],"lower":[81],"bounds,":[82],"develop":[83],"branch-and-bound":[85],"algorithm":[86,105],"solve":[88],"optimality":[92],"propose":[94],"shooting":[96],"method":[97],"accelerate":[99],"computation.":[100],"evaluate":[102],"developed":[104],"through":[106],"series":[108],"numerical":[110],"experiments":[111],"for":[112],"various":[113],"types":[114],"test":[116]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}