{"id":"https://openalex.org/W2160886201","doi":"https://doi.org/10.1007/s10732-007-9027-1","title":"The prize-collecting generalized minimum spanning tree problem","display_name":"The prize-collecting generalized minimum spanning tree problem","publication_year":2007,"publication_date":"2007-05-14","ids":{"openalex":"https://openalex.org/W2160886201","doi":"https://doi.org/10.1007/s10732-007-9027-1","mag":"2160886201"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-007-9027-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-007-9027-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-007-9027-1.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10732-007-9027-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022968381","display_name":"Bruce Golden","orcid":"https://orcid.org/0000-0002-5270-6094"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce Golden","raw_affiliation_strings":["The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020607292","display_name":"S. Raghavan","orcid":"https://orcid.org/0000-0002-9656-5596"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Raghavan","raw_affiliation_strings":["The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030448150","display_name":"Daliborka Stanojevi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daliborka Stanojevi\u0107","raw_affiliation_strings":["The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742-1815, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020607292"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":2.3761,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89626885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"1","first_page":"69","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7622343301773071},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6819396615028381},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6174274682998657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6169117093086243},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6118116974830627},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.590012788772583},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5359879732131958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5093055963516235},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.49148833751678467},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.463421493768692},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4304896295070648},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4124520421028137},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4118882417678833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3314884603023529},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3272724151611328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15349364280700684},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1281539499759674}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7622343301773071},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6819396615028381},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6174274682998657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6169117093086243},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6118116974830627},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.590012788772583},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5359879732131958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5093055963516235},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.49148833751678467},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.463421493768692},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4304896295070648},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4124520421028137},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4118882417678833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3314884603023529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3272724151611328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15349364280700684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1281539499759674},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10732-007-9027-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-007-9027-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-007-9027-1.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10732-007-9027-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-007-9027-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-007-9027-1.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160886201.pdf","grobid_xml":"https://content.openalex.org/works/W2160886201.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W81711424","https://openalex.org/W1486993561","https://openalex.org/W1558071713","https://openalex.org/W1963802054","https://openalex.org/W1977545325","https://openalex.org/W2018269848","https://openalex.org/W2032789430","https://openalex.org/W2051892429","https://openalex.org/W2057463094","https://openalex.org/W2071050202","https://openalex.org/W2077405310","https://openalex.org/W2078336410","https://openalex.org/W2088814889","https://openalex.org/W2110105948","https://openalex.org/W2111415774","https://openalex.org/W2142183404","https://openalex.org/W2151339549","https://openalex.org/W2161226285","https://openalex.org/W2165842651","https://openalex.org/W2167459401","https://openalex.org/W2172255557","https://openalex.org/W4285719527","https://openalex.org/W4301173492"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2899787781","https://openalex.org/W2381121915","https://openalex.org/W2074214908","https://openalex.org/W4206043061","https://openalex.org/W114880096","https://openalex.org/W1991082127"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,94,105],"prize-collecting":[3],"generalized":[4],"minimum":[5],"spanning":[6],"tree":[7,23],"problem.":[8],"In":[9],"this":[10],"problem":[11,43],"a":[12,22,38,56,62],"network":[13],"of":[14,90,104],"node":[15,28],"clusters":[16],"needs":[17],"to":[18,84],"be":[19],"connected":[20],"via":[21],"architecture":[24],"using":[25],"exactly":[26],"one":[27],"per":[29],"cluster.":[30],"Nodes":[31],"in":[32],"each":[33],"cluster":[34],"compete":[35],"by":[36],"offering":[37],"payment":[39],"for":[40,80,102],"selection.":[41],"This":[42],"is":[44],"NP-hard,":[45],"and":[46,55,64],"we":[47,60],"describe":[48],"several":[49],"heuristic":[50,95],"strategies,":[51],"including":[52],"local":[53],"search":[54,96],"genetic":[57],"algorithm.":[58,68],"Further,":[59],"present":[61],"simple":[63],"computationally":[65],"efficient":[66],"branch-and-cut":[67,75],"Our":[69],"computational":[70],"study":[71],"indicates":[72],"that":[73],"our":[74],"algorithm":[76],"finds":[77],"optimal":[78],"solutions":[79,101],"networks":[81],"with":[82],"up":[83],"200":[85],"nodes":[86],"within":[87],"two":[88],"hours":[89],"CPU":[91],"time,":[92],"while":[93],"procedures":[97],"rapidly":[98],"find":[99],"near-optimal":[100],"all":[103],"test":[106],"instances.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}