{"id":"https://openalex.org/W2199367678","doi":null,"title":"A Branch and Cut Algorithm for Solving an Intra-Ring Design Problem of Synchronous Optical Networks","display_name":"A Branch and Cut Algorithm for Solving an Intra-Ring Design Problem of Synchronous Optical Networks","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2199367678","mag":"2199367678"},"language":"en","primary_location":{"id":"mag:2199367678","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE01970528","pdf_url":null,"source":{"id":"https://openalex.org/S4306495885","display_name":"\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1","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":null,"display_name":"Young H. Lee","orcid":"https://orcid.org/0000-0001-8485-6807","observed_orcids":["https://orcid.org/0000-0001-8485-6807"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Young H. Lee","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8485-6807","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102162121","display_name":"Jung Hee Han","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jung Hee Han","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113516596","display_name":"Seong In Kim","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seong In Kim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5492,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.69873004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.8130000233650208,"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.8130000233650208,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.04529999941587448,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.017000000923871994,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/synchronous-optical-network","display_name":"synchronous optical network","score":0.7519999742507935},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.7739999890327454},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"branch-and-cut","score":0.8709999918937683},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.9710000157356262}],"concepts":[{"id":"https://openalex.org/C198306430","wikidata":"https://www.wikidata.org/wiki/Q51823","display_name":"Synchronous optical networking","level":2,"score":0.8528603315353394},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6663178205490112},{"id":"https://openalex.org/C2780378348","wikidata":"https://www.wikidata.org/wiki/Q25351438","display_name":"Ring (chemistry)","level":2,"score":0.5707231760025024},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5523166656494141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5517241954803467},{"id":"https://openalex.org/C122306262","wikidata":"https://www.wikidata.org/wiki/Q719775","display_name":"Ring network","level":3,"score":0.5200100541114807},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5072011947631836},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.489199161529541},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4632277488708496},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46199560165405273},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43516698479652405},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4323943257331848},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4202900528907776},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4130997657775879},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4012194275856018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37944215536117554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28127139806747437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2758917212486267},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27135467529296875},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14959600567817688},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.12227761745452881},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11459216475486755},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09175416827201843},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2199367678","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE01970528","pdf_url":null,"source":{"id":"https://openalex.org/S4306495885","display_name":"\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2156142180"],"related_works":["https://openalex.org/W2101186575","https://openalex.org/W2104649084","https://openalex.org/W2086153481","https://openalex.org/W11389118","https://openalex.org/W2082449498","https://openalex.org/W7096413269","https://openalex.org/W1969385974","https://openalex.org/W7098713138","https://openalex.org/W2035675328","https://openalex.org/W2147902857"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,61],"deal":[4],"with":[5,31],"a":[6,41,48],"ring":[7],"network":[8,18],"design":[9],"problem":[10,21,30,39],"arising":[11],"from":[12],"the":[13,38,55,58],"deployment":[14],"of":[15],"synchronous":[16],"optical":[17],"(SONET).":[19],"This":[20],"can":[22],"be":[23],"conceptualized":[24],"as":[25,40],"an":[26],"edge-capacitated":[27],"graph":[28],"partitioning":[29],"node":[32],"cardinality":[33],"constraints.":[34],"We":[35],"have":[36,62],"formulated":[37],"mixed":[42],"integer":[43],"programming":[44],"model,":[45],"and":[46],"developed":[47],"new":[49],"cutting":[50],"plane":[51],"method":[52],"for":[53],"solving":[54],"problem.":[56],"Implementing":[57],"proposed":[59],"method,":[60],"obtained":[63],"promising":[64],"computational":[65],"results.":[66]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}