{"id":"https://openalex.org/W2784083694","doi":"https://doi.org/10.1109/cdc.2017.8264513","title":"Solving the Lagrangian dual problem for some traffic coordination problems through linear programming","display_name":"Solving the Lagrangian dual problem for some traffic coordination problems through linear programming","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2784083694","doi":"https://doi.org/10.1109/cdc.2017.8264513","mag":"2784083694"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2017.8264513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8264513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5045014678","display_name":"Greyson Daugherty","orcid":"https://orcid.org/0000-0001-6359-0552"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greyson Daugherty","raw_affiliation_strings":["Georgia Institute of Technology, School of Industrial & Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, School of Industrial & Systems Engineering","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["Georgia Institute of Technology, School of Industrial & Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, School of Industrial & Systems Engineering","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015816401","display_name":"Greg Mohler","orcid":"https://orcid.org/0000-0001-7330-5962"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greg Mohler","raw_affiliation_strings":["Georgia Tech Research Institute, Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Tech Research Institute, Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5660","last_page":"5665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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/T10142","display_name":"Formal Methods in Verification","score":0.9954000115394592,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.626052737236023},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6151280403137207},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6025316715240479},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5795444846153259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5325656533241272},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5295318961143494},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47525855898857117},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.45215556025505066},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4338366985321045},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43342962861061096},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4239305257797241},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.41915658116340637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3267057538032532},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.20206928253173828},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1755223572254181},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12602290511131287}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.626052737236023},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6151280403137207},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6025316715240479},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5795444846153259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5325656533241272},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5295318961143494},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47525855898857117},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.45215556025505066},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4338366985321045},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43342962861061096},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4239305257797241},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.41915658116340637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3267057538032532},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.20206928253173828},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1755223572254181},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12602290511131287},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2017.8264513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8264513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1496620875","https://openalex.org/W1986164452","https://openalex.org/W2048036606","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2156553949","https://openalex.org/W2241553860","https://openalex.org/W2344384429","https://openalex.org/W2399153727","https://openalex.org/W2404271123","https://openalex.org/W2541273873","https://openalex.org/W2568881022","https://openalex.org/W2605051396","https://openalex.org/W2765503740","https://openalex.org/W2772828569","https://openalex.org/W2792991645","https://openalex.org/W2794965084","https://openalex.org/W2990961515","https://openalex.org/W4212851288","https://openalex.org/W4236384091","https://openalex.org/W4254313632","https://openalex.org/W4292230442","https://openalex.org/W6713083276","https://openalex.org/W6729318774"],"related_works":["https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W4383905034","https://openalex.org/W181997498","https://openalex.org/W1984467068","https://openalex.org/W2027845496","https://openalex.org/W3126007678","https://openalex.org/W2170308554","https://openalex.org/W2616198151","https://openalex.org/W2043978314"],"abstract_inverted_index":{"In":[0,56,97],"a":[1,9,27,67,75],"series":[2],"of":[3,11,49,74,78,81],"recent":[4],"publications,":[5],"we":[6,24,100],"have":[7,25],"addressed":[8],"class":[10],"traffic":[12],"coordination":[13],"problems":[14],"that":[15,71,102,106],"can":[16,113],"be":[17],"formulated":[18],"as":[19],"combinatorial":[20],"scheduling":[21],"problems,":[22],"and":[23,42],"developed":[26],"Lagrangian":[28],"duality":[29],"approach":[30],"for":[31,37,46,121],"obtaining":[32],"(i)":[33],"strong":[34],"lower":[35],"bounds":[36],"the":[38,47,60,79,82,94,103,109,122],"corresponding":[39,61],"optimal":[40],"solution,":[41],"(ii)":[43],"potential":[44],"\u201cseeds\u201d":[45],"construction":[48],"feasible,":[50],"near-optimal":[51],"solutions":[52],"to":[53,88,108],"these":[54],"problems.":[55],"those":[57],"past":[58,111],"works,":[59],"\u201cdual\u201d":[62,84,124],"problem":[63],"was":[64],"solved":[65],"through":[66],"customized":[68],"dual-ascent":[69],"algorithm":[70],"took":[72],"advantage":[73],"distributed":[76],"representation":[77],"sub-differentials":[80],"underlying":[83],"function":[85],"in":[86],"order":[87],"compute":[89],"efficiently":[90],"ascending":[91],"directions":[92],"during":[93],"optimization":[95],"process.":[96],"this":[98],"paper":[99],"show":[101],"fundamental":[104],"insights":[105],"led":[107],"aforementioned":[110],"developments,":[112],"also":[114],"enable":[115],"an":[116],"efficient":[117],"linear":[118],"programming":[119],"formulation":[120],"considered":[123],"problem.":[125],"<sup":[126],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[127],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[128]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}