{"id":"https://openalex.org/W205757152","doi":null,"title":"A parallel algorithm for nonlinear multi-commodity network flow problem","display_name":"A parallel algorithm for nonlinear multi-commodity network flow problem","alternate_titles":[],"publication_year":2006,"publication_date":"2006-07-10","ids":{"openalex":"https://openalex.org/W205757152","mag":"205757152"},"language":"en","primary_location":{"id":"mag:205757152","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2006cscc/papers/534-137.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419863","display_name":"International Conference on Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Systems","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W205757152"],"child_works_count":0,"type":"conference-paper","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/A5102133448","display_name":"Shieh-Shing Lin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210097625","display_name":"St. John's University","ror":"https://ror.org/00wyq5s37","country_code":"TW","type":"education","lineage":["https://openalex.org/I4210097625"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shieh-Shing Lin","raw_affiliation_strings":["Department of Electrical Engineering, St. John\u2019s University, Tamsui, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, St. John\u2019s University, Tamsui, Taiwan","institution_ids":["https://openalex.org/I4210097625"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111908875","display_name":"Huay Chang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I78768145","display_name":"Chihlee Institute of Technology","ror":"https://ror.org/02pcbw160","country_code":"TW","type":"education","lineage":["https://openalex.org/I78768145"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Huay Chang","raw_affiliation_strings":["Dept. of Information Management, Chihlee Institute of Technology#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Management, Chihlee Institute of Technology#TAB#","institution_ids":["https://openalex.org/I78768145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048873508","display_name":"Cheng\u2010Chien Kuo","orcid":"https://orcid.org/0000-0003-4990-0459","observed_orcids":["https://orcid.org/0000-0003-4990-0459"]},"institutions":[{"id":"https://openalex.org/I4210097625","display_name":"St. John's University","ror":"https://ror.org/00wyq5s37","country_code":"TW","type":"education","lineage":["https://openalex.org/I4210097625"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Cheng\u2010Chien Kuo","raw_affiliation_strings":["Department of Electrical Engineering, St. John\u2019s University, Tamsui, Taiwan"],"raw_orcid":"https://orcid.org/0000-0003-4990-0459","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, St. John\u2019s University, Tamsui, Taiwan","institution_ids":["https://openalex.org/I4210097625"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"332","last_page":"337"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7817000150680542,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7817000150680542,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.15080000460147858,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.020899999886751175,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.8489999771118164},{"id":"https://openalex.org/keywords/network-flow-optimization","display_name":"network flow optimization","score":0.6169999837875366},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.609000027179718}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6462600827217102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6227665543556213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6094776391983032},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.6063680052757263},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.60023432970047},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5699150562286377},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5523135662078857},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5419349074363708},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5306783318519592},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4741496443748474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44953471422195435},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.4354023337364197},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33591437339782715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31149888038635254},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2602243721485138},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08619073033332825},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:205757152","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2006cscc/papers/534-137.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419863","display_name":"International Conference on Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1561880747","https://openalex.org/W1603765807","https://openalex.org/W1986215185","https://openalex.org/W2006122291","https://openalex.org/W2006684039","https://openalex.org/W2018638861","https://openalex.org/W2021136283","https://openalex.org/W2092941378","https://openalex.org/W2095062278","https://openalex.org/W2121756644","https://openalex.org/W2134763711","https://openalex.org/W2156920109","https://openalex.org/W2158052609","https://openalex.org/W2160408584","https://openalex.org/W2177295793","https://openalex.org/W2250029315"],"related_works":["https://openalex.org/W4366151951","https://openalex.org/W2075690290","https://openalex.org/W2168418643","https://openalex.org/W2181307245","https://openalex.org/W1489283217","https://openalex.org/W7058336346","https://openalex.org/W2122497085","https://openalex.org/W1496960676","https://openalex.org/W2067774786"],"abstract_inverted_index":{"In":[0],"this":[1,19],"paper,":[2],"we":[3],"propose":[4],"a":[5,22,27],"method":[6,20,25,30,38,51],"to":[7],"solve":[8],"the":[9,35],"Nonlinear":[10],"Multicommodity":[11],"Network":[12],"Flow":[13],"(NMNF)":[14],"Problem.":[15],"We":[16,47],"have":[17,48],"combined":[18],"with":[21],"projected-Jacobi":[23],"(PJ)":[24],"and":[26,43,58],"duality":[28],"based":[29],"possessing":[31],"decomposition":[32],"effects.":[33],"With":[34],"decomposition,":[36],"our":[37,50],"can":[39],"be":[40],"parallel":[41],"processed":[42],"is":[44],"computationally":[45],"efficient.":[46],"tested":[49],"on":[52],"several":[53],"examples":[54],"of":[55],"NMNF":[56],"problem":[57],"obtained":[59],"some":[60],"successful":[61],"results.":[62]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W205757152","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
