{"id":"https://openalex.org/W2090101412","doi":"https://doi.org/10.1007/s10878-015-9834-5","title":"Heuristics for the network design problem with connectivity requirements","display_name":"Heuristics for the network design problem with connectivity requirements","publication_year":2015,"publication_date":"2015-02-17","ids":{"openalex":"https://openalex.org/W2090101412","doi":"https://doi.org/10.1007/s10878-015-9834-5","mag":"2090101412"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-015-9834-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9834-5","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5036521965","display_name":"Roman E. Shangin","orcid":null},"institutions":[{"id":"https://openalex.org/I107640659","display_name":"South Ural State University","ror":"https://ror.org/03sfk2504","country_code":"RU","type":"education","lineage":["https://openalex.org/I107640659"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Roman E. Shangin","raw_affiliation_strings":["Department of Computational Mathematics and Informatics, South Ural State University, Cheliabinsk, Russia","Department of Computational Mathematics and Informatics, South Ural State University, Cheliabinsk, Russia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computational Mathematics and Informatics, South Ural State University, Cheliabinsk, Russia","institution_ids":["https://openalex.org/I107640659"]},{"raw_affiliation_string":"Department of Computational Mathematics and Informatics, South Ural State University, Cheliabinsk, Russia#TAB#","institution_ids":["https://openalex.org/I107640659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Panos Pardalos","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA","Department of Industrial & Systems Engineering, University of Florida, Gainesville, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of Industrial & Systems Engineering, University of Florida, Gainesville, USA#TAB#","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036521965"],"corresponding_institution_ids":["https://openalex.org/I107640659"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.7276,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74410657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"31","issue":"4","first_page":"1461","last_page":"1478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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/heuristics","display_name":"Heuristics","score":0.78987717628479},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7355355620384216},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7056869864463806},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6202537417411804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5891225337982178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5161606073379517},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46487927436828613},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.44583818316459656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.439535915851593},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4382930397987366},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4354175925254822},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.42304831743240356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36818140745162964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35682016611099243},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32160624861717224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17316195368766785}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.78987717628479},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7355355620384216},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7056869864463806},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6202537417411804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5891225337982178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5161606073379517},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46487927436828613},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.44583818316459656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.439535915851593},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4382930397987366},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4354175925254822},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.42304831743240356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36818140745162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35682016611099243},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32160624861717224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17316195368766785},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-015-9834-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9834-5","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9834-5","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-015-9834-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320324261","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W74473743","https://openalex.org/W104868968","https://openalex.org/W145243417","https://openalex.org/W1664443250","https://openalex.org/W1967482931","https://openalex.org/W1971826280","https://openalex.org/W1984564385","https://openalex.org/W1994247939","https://openalex.org/W1999342715","https://openalex.org/W2017927472","https://openalex.org/W2020130108","https://openalex.org/W2023743599","https://openalex.org/W2030087828","https://openalex.org/W2037106315","https://openalex.org/W2042714316","https://openalex.org/W2048013200","https://openalex.org/W2052113818","https://openalex.org/W2062226917","https://openalex.org/W2081414924","https://openalex.org/W2082095538","https://openalex.org/W2089329485","https://openalex.org/W2098904848","https://openalex.org/W2118486696","https://openalex.org/W2133253967","https://openalex.org/W2139769441","https://openalex.org/W2143474538","https://openalex.org/W2148948822","https://openalex.org/W2174409790","https://openalex.org/W2320198223","https://openalex.org/W2405045331","https://openalex.org/W2600961830","https://openalex.org/W4247103873"],"related_works":["https://openalex.org/W30690955","https://openalex.org/W2612803944","https://openalex.org/W2978804656","https://openalex.org/W1604743927","https://openalex.org/W2063446209","https://openalex.org/W1412038523","https://openalex.org/W2494025814","https://openalex.org/W2168157396","https://openalex.org/W4312590477","https://openalex.org/W4243937306"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}