{"id":"https://openalex.org/W2097374731","doi":"https://doi.org/10.1002/net.3230070102","title":"A generalized upper bounding approach to a communications network planning problem","display_name":"A generalized upper bounding approach to a communications network planning problem","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W2097374731","doi":"https://doi.org/10.1002/net.3230070102","mag":"2097374731"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230070102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070102","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/A5087125685","display_name":"Charles J. McCallum","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. J. McCallum","raw_affiliation_strings":["Bell Laboratories Holmdel, New Jersey","Bell Laboratories, Holmdel, New Jersey#TAB#"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Holmdel, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Holmdel, New Jersey#TAB#","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087125685"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":4.7527,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.94891945,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9915000200271606,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.8389583826065063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6501888036727905},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.644967257976532},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.6133905649185181},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5827361345291138},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.580197811126709},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4936717450618744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2583491802215576},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13018062710762024}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8389583826065063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6501888036727905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.644967257976532},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.6133905649185181},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5827361345291138},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.580197811126709},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4936717450618744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2583491802215576},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13018062710762024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230070102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070102","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":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2024684012","https://openalex.org/W2042061024","https://openalex.org/W2046215222","https://openalex.org/W2095062278","https://openalex.org/W2135986386","https://openalex.org/W2160408584","https://openalex.org/W2565787298","https://openalex.org/W4231610975"],"related_works":["https://openalex.org/W1822681810","https://openalex.org/W2737096452","https://openalex.org/W2473635752","https://openalex.org/W2355014420","https://openalex.org/W1563136009","https://openalex.org/W2059958986","https://openalex.org/W1989850675","https://openalex.org/W178979937","https://openalex.org/W1984344073","https://openalex.org/W1999382246"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"important":[2],"network":[3,22],"optimization":[4],"problem":[5,41],"is":[6,58,79,87,92,96],"to":[7,25,60],"determine":[8],"the":[9,36,40,48,68,85],"routing":[10],"of":[11,15,39,54,84,99],"circuits":[12],"and":[13,76,89],"construction":[14],"additional":[16],"are":[17,103],"capacity":[18],"in":[19,47],"a":[20,44],"communications":[21],"so":[23],"as":[24,43],"satisfy":[26],"forecasted":[27],"circuit":[28],"requirements":[29],"at":[30],"minimum":[31],"cost.":[32],"This":[33],"paper":[34],"considers":[35],"single\u2010time\u2010period":[37],"version":[38],"formulated":[42],"linear":[45,56],"program":[46,57],"arc\u2010chain":[49],"form.":[50],"The":[51,81],"special":[52],"structure":[53],"this":[55],"exploited":[59],"develop":[61],"an":[62],"efficient":[63],"solution":[64],"procedure.":[65],"In":[66],"particular,":[67],"generalized":[69],"upper":[70],"bounding":[71],"technique":[72],"devised":[73],"by":[74],"Dantzig":[75],"Van":[77],"Slyke":[78],"applied.":[80],"computer":[82],"implementation":[83],"procedure":[86],"discussed":[88],"computational":[90],"experience":[91],"reported.":[93],"Brief":[94],"mention":[95],"also":[97],"made":[98],"certain":[100],"extensions":[101],"that":[102],"being":[104],"pursued.":[105]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}