{"id":"https://openalex.org/W645562817","doi":null,"title":"PARALLEL PROCESSING FOR SOME LARGE-SCALE NETWORK OPTIMIZATION PROBLEMS","display_name":"PARALLEL PROCESSING FOR SOME LARGE-SCALE NETWORK OPTIMIZATION PROBLEMS","publication_year":1983,"publication_date":"1983-10-01","ids":{"openalex":"https://openalex.org/W645562817","mag":"645562817"},"language":"en","primary_location":{"id":"mag:645562817","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/269182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5108559244","display_name":"Narsingh Deo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narsingh Deo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055580259","display_name":"Year Back Yoo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Year Back Yoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002649320","display_name":"Michael J. Quinn","orcid":"https://orcid.org/0000-0001-9021-9062","observed_orcids":["https://orcid.org/0000-0001-9021-9062"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J. Quinn","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9021-9062","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8740000128746033,"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.8740000128746033,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.10279999673366547,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.009100000374019146,"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/parallel-algorithms","display_name":"parallel algorithms","score":0.9559999704360962},{"id":"https://openalex.org/keywords/network-optimization","display_name":"network optimization","score":0.9150000214576721},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.8740000128746033},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9639999866485596},{"id":"https://openalex.org/keywords/mimd-parallel-computers","display_name":"MIMD parallel computers","score":0.9160000085830688},{"id":"https://openalex.org/keywords/parallel-data-structures","display_name":"parallel data structures","score":0.7099999785423279},{"id":"https://openalex.org/keywords/approximate-solutions","display_name":"approximate solutions","score":0.5189999938011169},{"id":"https://openalex.org/keywords/large-scale-networks","display_name":"large-scale networks","score":0.7559999823570251}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7876664400100708},{"id":"https://openalex.org/C21032095","wikidata":"https://www.wikidata.org/wiki/Q1149237","display_name":"MIMD","level":2,"score":0.7396158576011658},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.584987223148346},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5175894498825073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49560248851776123},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.48677563667297363},{"id":"https://openalex.org/C166782233","wikidata":"https://www.wikidata.org/wiki/Q127879","display_name":"Message Passing Interface","level":3,"score":0.43983641266822815},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43059438467025757},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4301784634590149},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4268835783004761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3366161584854126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3204280734062195},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.23965072631835938},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:645562817","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/269182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2069977975","https://openalex.org/W2167868964","https://openalex.org/W1513932854","https://openalex.org/W2029058995","https://openalex.org/W172042349","https://openalex.org/W2032177924","https://openalex.org/W1488595466","https://openalex.org/W1536669251","https://openalex.org/W2111902986","https://openalex.org/W1585599370"],"abstract_inverted_index":{"Techniques":[0],"of":[1,46,50,101,112,148],"designing":[2],"parallel":[3,47,52,68,77,93,105,128],"programs":[4,69],"for":[5,32,66,82,91,107],"solving":[6,33,83],"large-scale":[7],"network":[8],"optimization":[9],"problems":[10,23],"are":[11,18,61],"developed":[12,54],"in":[13,136],"this":[14,122],"study.":[15],"These":[16],"techniques":[17],"illustrated":[19],"with":[20],"three":[21],"different":[22],"on":[24,39,117],"networks.":[25,139],"Part":[26,73,98],"I,":[27],"contains":[28,75],"two":[29],"distinct":[30],"algorithms":[31,53],"the":[34,51,56,67,84,92,113],"one-to-all":[35],"shortest":[36],"path":[37],"problem":[38,116],"a":[40,76],"tightly-coupled,":[41],"multiple-instruction-stream,":[42],"multiple-data-stream":[43],"(MIMD)":[44],"type":[45],"computer.":[48],"Description":[49],"and":[55,79],"novel":[57],"data":[58],"structures":[59],"employed":[60],"included.":[62,96],"A":[63,88],"user's":[64,89],"manual":[65,90],"is":[70,95,125],"also":[71],"given.":[72],"II":[74],"algorithm":[78,106],"its":[80],"performance":[81],"minimum-cost":[85],"network-flow":[86],"problem.":[87],"program":[94],"Finally,":[97],"III":[99],"consists":[100],"an":[102,109,118],"extremely":[103],"fast":[104],"finding":[108],"approximate":[110],"solution":[111],"traveling":[114],"salesman":[115],"Euclidean":[119],"plane.":[120],"From":[121],"study":[123],"it":[124],"evident":[126],"that":[127],"computers":[129,143],"can":[130],"be":[131],"utilized":[132],"to":[133],"gain":[134],"speeds":[135],"processing":[137],"large":[138],"The":[140],"fifth":[141],"generation":[142],"wil":[144],"require":[145],"extensive":[146],"body":[147],"application":[149],"software.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}