{"id":"https://openalex.org/W2096790820","doi":"https://doi.org/10.1109/lcn.2002.1181772","title":"Solving the MCOP problem optimally","display_name":"Solving the MCOP problem optimally","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W2096790820","doi":"https://doi.org/10.1109/lcn.2002.1181772","mag":"2096790820"},"language":"en","primary_location":{"id":"doi:10.1109/lcn.2002.1181772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2002.1181772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002.","raw_type":"proceedings-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/A5102107022","display_name":"Wen-Lin Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I1309796872","display_name":"National Pingtung University","ror":"https://ror.org/03z698x91","country_code":"TW","type":"education","lineage":["https://openalex.org/I1309796872"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Wen-Lin Yang","raw_affiliation_strings":["Department of Information Technology, National Pingtung Institute of Commerce, Ping Tung, Taiwan","Dept. of Inf. Technol., Nat. Pingtung Inst. of Commerce, Pingtung City, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, National Pingtung Institute of Commerce, Ping Tung, Taiwan","institution_ids":["https://openalex.org/I1309796872"]},{"raw_affiliation_string":"Dept. of Inf. Technol., Nat. Pingtung Inst. of Commerce, Pingtung City, Taiwan","institution_ids":["https://openalex.org/I1309796872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102107022"],"corresponding_institution_ids":["https://openalex.org/I1309796872"],"apc_list":null,"apc_paid":null,"fwci":0.2361,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62754275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"i","issue":null,"first_page":"100","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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.9997000098228455,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9993000030517578,"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/computer-science","display_name":"Computer science","score":0.8510981798171997},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.7751251459121704},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6258660554885864},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6007418036460876},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5867513418197632},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.515915036201477},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45406007766723633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43605536222457886},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4027556777000427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23413601517677307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11799466609954834}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8510981798171997},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.7751251459121704},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6258660554885864},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6007418036460876},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5867513418197632},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.515915036201477},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45406007766723633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43605536222457886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4027556777000427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23413601517677307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11799466609954834},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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":1,"locations":[{"id":"doi:10.1109/lcn.2002.1181772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2002.1181772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1914921536","https://openalex.org/W1997179057","https://openalex.org/W2019819322","https://openalex.org/W2086581750","https://openalex.org/W2105808107","https://openalex.org/W2112912183","https://openalex.org/W2116466881","https://openalex.org/W2125401948","https://openalex.org/W2127456145","https://openalex.org/W2130202407","https://openalex.org/W2148837283","https://openalex.org/W2170358592","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W2140798747","https://openalex.org/W2366206435","https://openalex.org/W2948169060","https://openalex.org/W2730112582","https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W4394849239","https://openalex.org/W2182290077"],"abstract_inverted_index":{"Providing":[0],"guaranteed":[1],"end-to-end":[2,34],"quality":[3],"of":[4,63,67,129,131],"service":[5],"(QoS)":[6],"is":[7,94,100,115,121,139],"a":[8,23,26,32],"key":[9],"issue":[10],"for":[11,57,111,124],"deploying":[12],"multimedia":[13],"applications":[14],"on":[15],"broadband":[16],"integrated":[17],"services":[18],"networks.":[19],"To":[20],"support":[21],"such":[22],"QoS-based":[24],"service,":[25],"problem":[27],"concerning":[28],"how":[29],"to":[30,38,102],"select":[31],"feasible":[33],"path":[35],"in":[36],"order":[37],"satisfy":[39],"multiple":[40],"QoS":[41],"constraints":[42],"simultaneously":[43],"must":[44],"be":[45],"studied.":[46],"Two":[47],"exact":[48],"algorithms,":[49,54],"branch-and-bound":[50,69,83,119],"and":[51,105],"extended":[52,89],"Bellman-Ford":[53,90],"are":[55],"proposed":[56],"this":[58],"NP-complete":[59],"problem.":[60],"In":[61],"spite":[62],"the":[64,68,75,82,88,127,132],"time":[65],"complexity":[66],"algorithm":[70],"being":[71],"O(d/sup":[72],"n/)":[73],"at":[74],"worst":[76],"case,":[77],"simulation":[78],"results":[79],"show":[80],"that":[81,117],"method":[84,97,120],"not":[85],"only":[86,123],"outperforms":[87],"method,":[91],"but":[92],"also":[93],"an":[95],"efficient":[96,122],"when":[98],"it":[99,114],"applied":[101],"random":[103],"networks":[104,107,125],"practical":[106],"like":[108],"ANSNET.":[109],"As":[110],"mesh":[112],"networks,":[113],"observed":[116],"our":[118],"where":[126],"number":[128],"hops":[130],"desired":[133],"MCOP":[134],"(multiple":[135],"constrained":[136],"optimal":[137],"path)":[138],"less":[140],"than":[141],"15.":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}