{"id":"https://openalex.org/W2140951480","doi":"https://doi.org/10.1002/net.3230170102","title":"The node\u2010weighted steiner tree problem","display_name":"The node\u2010weighted steiner tree problem","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2140951480","doi":"https://doi.org/10.1002/net.3230170102","mag":"2140951480"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170102","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5108189517","display_name":"Arie Segev","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arie Segev","raw_affiliation_strings":["School of Business Administration, University of California, Berkeley, California 94720","Uinv. of California at Berkeley, Berkeley#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Business Administration, University of California, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Uinv. of California at Berkeley, Berkeley#TAB#","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108189517"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.1188,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.87267139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12176","display_name":"Optimization and Packing Problems","score":0.9907000064849854,"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/T10142","display_name":"Formal Methods in Verification","score":0.9896000027656555,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8586664199829102},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.8351783752441406},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6974322199821472},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6637545228004456},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.6188865900039673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5951138734817505},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.586030125617981},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5645633935928345},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.514237105846405},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4630340337753296},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4629977345466614},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.44892072677612305},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44678816199302673},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4349318742752075},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43107330799102783},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.42278575897216797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32217204570770264},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.0800386369228363}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8586664199829102},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8351783752441406},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6974322199821472},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6637545228004456},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.6188865900039673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5951138734817505},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.586030125617981},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5645633935928345},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.514237105846405},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4630340337753296},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4629977345466614},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44892072677612305},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44678816199302673},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4349318742752075},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43107330799102783},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.42278575897216797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32217204570770264},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.0800386369228363},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/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.1002/net.3230170102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170102","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":22,"referenced_works":["https://openalex.org/W1527658630","https://openalex.org/W1554451661","https://openalex.org/W1973315504","https://openalex.org/W1996668544","https://openalex.org/W2000675190","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2009803313","https://openalex.org/W2011039300","https://openalex.org/W2017127755","https://openalex.org/W2017927472","https://openalex.org/W2018638861","https://openalex.org/W2020586530","https://openalex.org/W2071845176","https://openalex.org/W2115616619","https://openalex.org/W2132087752","https://openalex.org/W2165012734","https://openalex.org/W2321605606","https://openalex.org/W4236384091","https://openalex.org/W4242130683","https://openalex.org/W4250535541","https://openalex.org/W4300129394"],"related_works":["https://openalex.org/W3183857959","https://openalex.org/W2037613239","https://openalex.org/W4243844638","https://openalex.org/W3032916910","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W2363143319","https://openalex.org/W2351035339","https://openalex.org/W1980006501","https://openalex.org/W2012703063"],"abstract_inverted_index":{"Abstract":[0],"The":[1,55,93],"general":[2],"Node\u2010Weighted":[3],"Steiner":[4,13],"Tree":[5,14],"problem":[6,15],"is":[7,58,67,99],"an":[8],"extension":[9],"of":[10,19,28,34,45,95,104],"the":[11,17,32,41,96],"standard":[12],"by":[16,87,101],"addition":[18],"node\u2010associated":[20],"weights.":[21],"This":[22],"article":[23],"analyzes":[24],"a":[25,46,88,102],"special":[26,56],"case":[27,57],"that":[29],"problem,":[30],"where":[31],"set":[33,103],"nodes,":[35],"which":[36],"must":[37],"be":[38,61],"included":[39],"in":[40],"solution":[42],"tree,":[43],"consists":[44],"single":[47],"node,":[48],"and":[49,69,77,85,90],"all":[50],"node":[51],"weights":[52],"are":[53,72],"negative.":[54],"shown":[59],"to":[60],"NP\u2010Complete,":[62],"its":[63],"integer":[64],"programming":[65],"formulation":[66],"presented,":[68],"heuristic":[70],"procedures":[71,98],"proposed.":[73],"Using":[74],"Lagrangian":[75],"relaxation":[76],"subgradient":[78],"optimization,":[79],"tight":[80],"lower":[81],"bounds":[82],"were":[83],"derived":[84],"utilized":[86],"branch":[89],"bound":[91],"algorithm.":[92],"effectiveness":[94],"developed":[97],"demonstrated":[100],"computational":[105],"experiments.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}