{"id":"https://openalex.org/W1537499662","doi":"https://doi.org/10.1109/iscc.2004.1358664","title":"A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering","display_name":"A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1537499662","doi":"https://doi.org/10.1109/iscc.2004.1358664","mag":"1537499662"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2004.1358664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2004.1358664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","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/A5065128184","display_name":"G. Retvdri","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G. Retvdri","raw_affiliation_strings":["Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081387612","display_name":"J\u00f3zsef B\u0131\u0301r\u00f3","orcid":"https://orcid.org/0000-0002-9729-2702"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"J.J. Biro","raw_affiliation_strings":["Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023288330","display_name":"Tibor Cinkler","orcid":"https://orcid.org/0000-0003-3605-445X"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"T. Cinkler","raw_affiliation_strings":["Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.697,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83955628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"957","last_page":"962 Vol.2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9926999807357788,"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.9872000217437744,"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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7008706331253052},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.684101402759552},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6752413511276245},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6505342721939087},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6275500655174255},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.6117537021636963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5224670171737671},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5103372931480408},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48695334792137146},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4704904556274414},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.43160128593444824},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4210954010486603},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4157235026359558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33581358194351196},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2242090404033661},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1858317255973816},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.13015082478523254},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08902740478515625}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7008706331253052},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.684101402759552},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6752413511276245},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6505342721939087},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6275500655174255},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.6117537021636963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5224670171737671},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5103372931480408},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48695334792137146},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4704904556274414},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.43160128593444824},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4210954010486603},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4157235026359558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33581358194351196},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2242090404033661},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1858317255973816},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.13015082478523254},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08902740478515625},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2004.1358664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2004.1358664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5099999904632568,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W207529665","https://openalex.org/W1977545325","https://openalex.org/W2010997912","https://openalex.org/W2036772106","https://openalex.org/W2048790997","https://openalex.org/W2121959042","https://openalex.org/W2148469056","https://openalex.org/W2163907500","https://openalex.org/W2165030634","https://openalex.org/W2248064281","https://openalex.org/W2913988959","https://openalex.org/W2920966226","https://openalex.org/W4213060235","https://openalex.org/W4230398107","https://openalex.org/W4240422548","https://openalex.org/W6681985713","https://openalex.org/W6691190440","https://openalex.org/W6721783347","https://openalex.org/W6758896924","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W2256354701","https://openalex.org/W4231500168","https://openalex.org/W2374451529","https://openalex.org/W3161514703","https://openalex.org/W2119460644","https://openalex.org/W4233329165","https://openalex.org/W2348121120"],"abstract_inverted_index":{"The":[0],"minimum":[1,44],"cost":[2,45],"multicommodity":[3,46],"flow":[4,47,54],"problem":[5,48],"plays":[6],"a":[7,31,50,70],"central":[8],"role":[9],"in":[10],"today's":[11],"operations":[12],"research":[13],"theory":[14],"with":[15],"applications":[16],"ranging":[17],"from":[18],"transportation":[19],"and":[20],"logistics":[21],"to":[22],"telecommunications":[23],"network":[24],"routing.":[25],"In":[26],"this":[27],"paper,":[28],"we":[29],"introduce":[30],"novel":[32],"Lagrangian-relaxation":[33],"technique,":[34],"which,":[35],"given":[36,71],"an":[37],"initial":[38],"feasible":[39],"solution,":[40],"can":[41,67],"solve":[42],"the":[43,80,85],"as":[49,87],"sequence":[51],"of":[52],"single-commodity":[53],"problems.":[55],"Our":[56],"methodology":[57],"is":[58],"best":[59],"suited":[60],"for":[61],"OSPF":[62],"traffic":[63],"engineering,":[64],"because":[65],"it":[66],"rapidly":[68],"improve":[69],"path":[72],"set":[73],"towards":[74],"approximate":[75],"optimality":[76],"while":[77],"simultaneously":[78],"provides":[79],"link":[81],"weights,":[82],"which":[83],"implement":[84],"paths":[86],"shortest":[88],"paths.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}