{"id":"https://openalex.org/W2020586530","doi":"https://doi.org/10.1007/bf02612335","title":"A dual ascent approach for steiner tree problems on a directed graph","display_name":"A dual ascent approach for steiner tree problems on a directed graph","publication_year":1984,"publication_date":"1984-10-01","ids":{"openalex":"https://openalex.org/W2020586530","doi":"https://doi.org/10.1007/bf02612335","mag":"2020586530"},"language":"en","primary_location":{"id":"doi:10.1007/bf02612335","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02612335","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5039565177","display_name":"Richard T. Wong","orcid":"https://orcid.org/0000-0001-5543-9975"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard T. Wong","raw_affiliation_strings":["Purdue University, 47907, West Lafayette, IN, USA","Purdue University, West lafayette, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, 47907, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University, West lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039565177"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":19.0237,"has_fulltext":false,"cited_by_count":360,"citation_normalized_percentile":{"value":0.99364486,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"28","issue":"3","first_page":"271","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6655372977256775},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6377770900726318},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.602181077003479},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.583047091960907},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5686918497085571},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5381529927253723},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.53593909740448},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5002591609954834},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4978666305541992},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4787147045135498},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4558112323284149},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4274020791053772},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.4176105558872223},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40378910303115845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.376785010099411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.336745023727417},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.25906506180763245},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22990193963050842},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.1294177770614624},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09307432174682617}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6655372977256775},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6377770900726318},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.602181077003479},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.583047091960907},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5686918497085571},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5381529927253723},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.53593909740448},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5002591609954834},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4978666305541992},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4787147045135498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4558112323284149},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4274020791053772},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.4176105558872223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40378910303115845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.376785010099411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336745023727417},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.25906506180763245},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22990193963050842},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.1294177770614624},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09307432174682617},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02612335","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02612335","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1481577095","https://openalex.org/W1973315504","https://openalex.org/W1977879268","https://openalex.org/W1988615825","https://openalex.org/W1996668544","https://openalex.org/W2007503572","https://openalex.org/W2011039300","https://openalex.org/W2072664764","https://openalex.org/W2080169294","https://openalex.org/W2086522200","https://openalex.org/W2125690626","https://openalex.org/W2132087752","https://openalex.org/W2147336456","https://openalex.org/W2165012734","https://openalex.org/W2171985270","https://openalex.org/W2486518807","https://openalex.org/W4285719527","https://openalex.org/W4298880987","https://openalex.org/W6827597832"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W1980288485","https://openalex.org/W3195448539","https://openalex.org/W1992573093","https://openalex.org/W1584380088","https://openalex.org/W1992362850","https://openalex.org/W1595291551","https://openalex.org/W1480583742","https://openalex.org/W2081066931","https://openalex.org/W2550142813"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}