{"id":"https://openalex.org/W2155239253","doi":"https://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","title":"Solving Steiner tree problems in graphs to optimality","display_name":"Solving Steiner tree problems in graphs to optimality","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2155239253","doi":"https://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","mag":"2155239253"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","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/A5066794150","display_name":"Thorsten Koch","orcid":"https://orcid.org/0000-0002-1967-0077"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T. Koch","raw_affiliation_strings":["Konrad-Zuse-Zentrum fu\u0308r Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany"],"affiliations":[{"raw_affiliation_string":"Konrad-Zuse-Zentrum fu\u0308r Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006197528","display_name":"Alexander Mart\u00edn","orcid":"https://orcid.org/0000-0001-7602-3653"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"A. Martin","raw_affiliation_strings":["Konrad-Zuse-Zentrum fu\u0308r Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany"],"affiliations":[{"raw_affiliation_string":"Konrad-Zuse-Zentrum fu\u0308r Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006197528"],"corresponding_institution_ids":["https://openalex.org/I195893171"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":10.0924,"has_fulltext":false,"cited_by_count":248,"citation_normalized_percentile":{"value":0.98588119,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"32","issue":"3","first_page":"207","last_page":"232"},"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.9998999834060669,"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.9998999834060669,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.992900013923645,"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.9217969179153442},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.699870765209198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5911779999732971},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5124983787536621},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4828208386898041},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47897103428840637},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.468517541885376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45449745655059814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40072646737098694},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37526679039001465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31471842527389526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24344390630722046},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15318980813026428}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9217969179153442},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.699870765209198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5911779999732971},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5124983787536621},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4828208386898041},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47897103428840637},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.468517541885376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45449745655059814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40072646737098694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37526679039001465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31471842527389526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24344390630722046},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15318980813026428}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-o","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.116.3535","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.zib.de/koch/biblio/paper/kochmartin1998.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.527","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.zib.de/pub/zib-publications/reports/SC-96-42.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.988","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://opus.kobv.de/zib/volltexte/1996/253/pdf/SC-96-42.pdf","raw_type":"text"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-010358205","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"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":36,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1005876121","https://openalex.org/W1522776502","https://openalex.org/W1969535044","https://openalex.org/W1974745840","https://openalex.org/W1975442866","https://openalex.org/W1996668544","https://openalex.org/W1999578543","https://openalex.org/W2004092973","https://openalex.org/W2005064625","https://openalex.org/W2008771115","https://openalex.org/W2020112047","https://openalex.org/W2020586530","https://openalex.org/W2022912747","https://openalex.org/W2029242918","https://openalex.org/W2042492403","https://openalex.org/W2057672746","https://openalex.org/W2063395464","https://openalex.org/W2066356146","https://openalex.org/W2068362339","https://openalex.org/W2077285971","https://openalex.org/W2080156195","https://openalex.org/W2082150701","https://openalex.org/W2082591111","https://openalex.org/W2095284441","https://openalex.org/W2115036101","https://openalex.org/W2117937654","https://openalex.org/W2119918317","https://openalex.org/W2125690626","https://openalex.org/W2134143366","https://openalex.org/W2148237104","https://openalex.org/W2158598102","https://openalex.org/W2164245156","https://openalex.org/W2170038379","https://openalex.org/W2295732415","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W1970145791","https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2143061299","https://openalex.org/W2734758384","https://openalex.org/W2734253256","https://openalex.org/W2263874601"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"the":[5,49,79,100],"implementation":[6],"of":[7,81],"a":[8,90],"branch-and-cut":[9],"algorithm":[10,19],"for":[11,27],"solving":[12],"Steiner":[13,74],"tree":[14,75],"problems":[15,76,86],"in":[16,48,89],"graphs.":[17],"Our":[18],"is":[20,97],"based":[21],"on":[22,66],"an":[23],"integer":[24],"programming":[25],"formulation":[26],"directed":[28],"graphs":[29],"and":[30,35],"comprises":[31],"preprocessing,":[32],"separation":[33],"algorithms,":[34],"primal":[36],"heuristics.":[37],"We":[38,63],"are":[39,87],"able":[40],"to":[41,51],"solve":[42],"nearly":[43],"all":[44],"problem":[45,55],"instances":[46],"discussed":[47],"literature":[50],"optimality,":[52],"including":[53],"one":[54],"that\u2014to":[56],"our":[57,67],"knowledge\u2014has":[58],"not":[59],"yet":[60],"been":[61],"solved.":[62],"also":[64],"report":[65],"computational":[68],"experiences":[69],"with":[70],"some":[71],"very":[72],"large":[73],"arising":[77],"from":[78],"design":[80],"electronic":[82],"circuits.":[83],"All":[84],"test":[85],"gathered":[88],"newly":[91],"introduced":[92],"library":[93],"called":[94],"SteinLib":[95],"that":[96],"accessible":[98],"via":[99],"World":[101],"Wide":[102],"Web.":[103],"\u00a9":[104],"1998":[105,114],"John":[106],"Wiley":[107],"&":[108],"Sons,":[109],"Inc.":[110],"Networks":[111],"32:":[112],"207\u2013232,":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}