{"id":"https://openalex.org/W2922172396","doi":"https://doi.org/10.1007/bf02073940","title":"Least-cost network topology design for a new service","display_name":"Least-cost network topology design for a new service","publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W2922172396","doi":"https://doi.org/10.1007/bf02073940","mag":"2922172396"},"language":"en","primary_location":{"id":"doi:10.1007/bf02073940","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02073940","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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/A5068174754","display_name":"Fred Glover","orcid":"https://orcid.org/0000-0001-6945-0438"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fred Glover","raw_affiliation_strings":["Center for Applied Artificial Intelligence, University of Colorado, 80309-0419, Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Applied Artificial Intelligence, University of Colorado, 80309-0419, Boulder, CO, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001087473","display_name":"Micheal Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I893249203","display_name":"PNM Resources (United States)","ror":"https://ror.org/0092af185","country_code":"US","type":"company","lineage":["https://openalex.org/I893249203"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Micheal Lee","raw_affiliation_strings":["Public Service Company of Colorado, Denver, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Public Service Company of Colorado, Denver, CO, USA","institution_ids":["https://openalex.org/I893249203"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103262911","display_name":"Jennifer K. Ryan","orcid":"https://orcid.org/0000-0002-8045-8614"},"institutions":[{"id":"https://openalex.org/I921990950","display_name":"University of Colorado Denver","ror":"https://ror.org/02hh7en24","country_code":"US","type":"education","lineage":["https://openalex.org/I921990950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jennifer Ryan","raw_affiliation_strings":["Department of Mathematics, University of Colorado at Denver, 80217-3364, Denver, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Colorado at Denver, 80217-3364, Denver, CO, USA","institution_ids":["https://openalex.org/I921990950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.49521182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"33","issue":"5","first_page":"351","last_page":"362"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9943000078201294,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/tabu-search","display_name":"Tabu search","score":0.9513031244277954},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.754745602607727},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6310018301010132},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6147488951683044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5894885659217834},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5873658061027527},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5777022242546082},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5141704082489014},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4721510410308838},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4321591258049011},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4282088875770569},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.4134369194507599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29953762888908386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2380378246307373},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08119651675224304}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9513031244277954},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.754745602607727},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6310018301010132},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6147488951683044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5894885659217834},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5873658061027527},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5777022242546082},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5141704082489014},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4721510410308838},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4321591258049011},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4282088875770569},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.4134369194507599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29953762888908386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2380378246307373},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08119651675224304},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02073940","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02073940","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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":6,"referenced_works":["https://openalex.org/W2016688797","https://openalex.org/W2052469048","https://openalex.org/W2104670598","https://openalex.org/W2123608273","https://openalex.org/W4246598646","https://openalex.org/W6600497418"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W2040147369","https://openalex.org/W4280543056","https://openalex.org/W2154172459","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W45904909","https://openalex.org/W1517981012"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}