{"id":"https://openalex.org/W2063522894","doi":"https://doi.org/10.1007/s11590-011-0368-1","title":"A branch-and-cut algorithm for the Steiner tree problem with delays","display_name":"A branch-and-cut algorithm for the Steiner tree problem with delays","publication_year":2011,"publication_date":"2011-07-21","ids":{"openalex":"https://openalex.org/W2063522894","doi":"https://doi.org/10.1007/s11590-011-0368-1","mag":"2063522894"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-011-0368-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-011-0368-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/A5081308471","display_name":"Valeria Leggieri","orcid":"https://orcid.org/0000-0002-3351-2665"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]},{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"V. Leggieri","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 del Salento, 73100, Lecce, Italy","Faculty of Computer Science, Free University of Bozen-Bolzano, 39100, Bolzano, Italy","Universit\u00e0 del Salento","Free University of Bozen-Bolzano"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 del Salento, 73100, Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Faculty of Computer Science, Free University of Bozen-Bolzano, 39100, Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]},{"raw_affiliation_string":"Universit\u00e0 del Salento","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Free University of Bozen-Bolzano","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057119785","display_name":"Mohamed Haouari","orcid":"https://orcid.org/0000-0003-0767-8220"},"institutions":[{"id":"https://openalex.org/I2800887215","display_name":"Tunisia Polytechnic School","ror":"https://ror.org/00dse3307","country_code":"TN","type":"education","lineage":["https://openalex.org/I2800887215"]},{"id":"https://openalex.org/I28022161","display_name":"King Saud University","ror":"https://ror.org/02f81g417","country_code":"SA","type":"education","lineage":["https://openalex.org/I28022161"]},{"id":"https://openalex.org/I44925452","display_name":"\u00d6zye\u011fin University","ror":"https://ror.org/01jjhfr75","country_code":"TR","type":"education","lineage":["https://openalex.org/I44925452"]}],"countries":["SA","TN","TR"],"is_corresponding":false,"raw_author_name":"M. Haouari","raw_affiliation_strings":["Combinatorial Optimization Research Group, ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia","Department of Industrial Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey","Princess Fatimah Alnijris\u2019 Research Chair for AMT, College of Engineering, King Saud University, Riyadh, Saudi Arabia","King Saud University","Ozyegin University","Ecole Polytechnique de Tunisie"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Combinatorial Optimization Research Group, ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia","institution_ids":["https://openalex.org/I2800887215"]},{"raw_affiliation_string":"Department of Industrial Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey","institution_ids":["https://openalex.org/I44925452"]},{"raw_affiliation_string":"Princess Fatimah Alnijris\u2019 Research Chair for AMT, College of Engineering, King Saud University, Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I28022161"]},{"raw_affiliation_string":"King Saud University","institution_ids":["https://openalex.org/I28022161"]},{"raw_affiliation_string":"Ozyegin University","institution_ids":["https://openalex.org/I44925452"]},{"raw_affiliation_string":"Ecole Polytechnique de Tunisie","institution_ids":["https://openalex.org/I2800887215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039886917","display_name":"Chefi Triki","orcid":"https://orcid.org/0000-0002-8750-2470"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"C. Triki","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 del Salento, 73100, Lecce, Italy","UNIVERSITA' DEL SALENTO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 del Salento, 73100, Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"UNIVERSITA' DEL SALENTO","institution_ids":["https://openalex.org/I142910587"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081308471"],"corresponding_institution_ids":["https://openalex.org/I142910587","https://openalex.org/I171543936"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2703,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62143922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":"8","first_page":"1753","last_page":"1771"},"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.9995999932289124,"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.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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.8442821502685547},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.5592674612998962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5277883410453796},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.51747727394104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5081624984741211},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4669564664363861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4015198349952698},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3325577974319458},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.315518856048584},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2723925709724426},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.18266019225120544}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8442821502685547},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.5592674612998962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5277883410453796},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.51747727394104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5081624984741211},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4669564664363861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4015198349952698},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3325577974319458},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.315518856048584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2723925709724426},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.18266019225120544}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s11590-011-0368-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-011-0368-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:alma.39UBZ_INST:11234959290001241","is_oa":false,"landing_page_url":"https://bia.unibz.it/esploro/outputs/journalArticle/A-branch-and-cut-algorithm-for-the-Steiner/991005772433901241","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:eresearch.ozyegin.edu.tr:10679/477","is_oa":false,"landing_page_url":"http://hdl.handle.net/10679/477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1482298744","https://openalex.org/W1520007244","https://openalex.org/W1549024083","https://openalex.org/W1583961104","https://openalex.org/W1968143987","https://openalex.org/W1970760181","https://openalex.org/W1977129671","https://openalex.org/W1983799289","https://openalex.org/W1984192656","https://openalex.org/W2004305790","https://openalex.org/W2007503572","https://openalex.org/W2031167811","https://openalex.org/W2037357784","https://openalex.org/W2039021074","https://openalex.org/W2042243968","https://openalex.org/W2049287714","https://openalex.org/W2057725412","https://openalex.org/W2060514920","https://openalex.org/W2070817156","https://openalex.org/W2093592023","https://openalex.org/W2105887395","https://openalex.org/W2127988931","https://openalex.org/W2146853131","https://openalex.org/W2152950844","https://openalex.org/W2155239253","https://openalex.org/W2336259629","https://openalex.org/W2505968561","https://openalex.org/W3142061031","https://openalex.org/W4240018335","https://openalex.org/W4245460500"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W2025658531","https://openalex.org/W1503036335","https://openalex.org/W3187836939","https://openalex.org/W2143061299","https://openalex.org/W2734253256","https://openalex.org/W1914605361","https://openalex.org/W2962745046","https://openalex.org/W2063522894"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}