{"id":"https://openalex.org/W2138760184","doi":"https://doi.org/10.1109/coase.2008.4626544","title":"An improved lagrangian relaxation method for discrete optimization applications","display_name":"An improved lagrangian relaxation method for discrete optimization applications","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2138760184","doi":"https://doi.org/10.1109/coase.2008.4626544","mag":"2138760184"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2008.4626544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","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/A5115589290","display_name":"Weihua Wang","orcid":"https://orcid.org/0009-0002-3834-0951"},"institutions":[{"id":"https://openalex.org/I87828566","display_name":"Edison International (United States)","ror":"https://ror.org/03q0f4n26","country_code":"US","type":"company","lineage":["https://openalex.org/I87828566"]},{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weihua Wang","raw_affiliation_strings":["Southern California Edison, Market Strategy and Resource Planning, Rosemead, CA, USA","Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT#TAB#"],"affiliations":[{"raw_affiliation_string":"Southern California Edison, Market Strategy and Resource Planning, Rosemead, CA, USA","institution_ids":["https://openalex.org/I87828566"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT#TAB#","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070935042","display_name":"Peter B. Luh","orcid":"https://orcid.org/0000-0002-5158-7388"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]},{"id":"https://openalex.org/I87828566","display_name":"Edison International (United States)","ror":"https://ror.org/03q0f4n26","country_code":"US","type":"company","lineage":["https://openalex.org/I87828566"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter B. Luh","raw_affiliation_strings":["Southern California Edison, Market Strategy and Resource Planning, Rosemead, CA, USA","Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT#TAB#"],"affiliations":[{"raw_affiliation_string":"Southern California Edison, Market Strategy and Resource Planning, Rosemead, CA, USA","institution_ids":["https://openalex.org/I87828566"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT#TAB#","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111463394","display_name":"Joseph H. Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I87828566","display_name":"Edison International (United States)","ror":"https://ror.org/03q0f4n26","country_code":"US","type":"company","lineage":["https://openalex.org/I87828566"]},{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph H. Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","Market Strategy and Resource Planning, Southern California Edison, Rosemead, 91770 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Market Strategy and Resource Planning, Southern California Edison, Rosemead, 91770 USA","institution_ids":["https://openalex.org/I87828566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007886799","display_name":"Gary A. Stern","orcid":null},"institutions":[{"id":"https://openalex.org/I87828566","display_name":"Edison International (United States)","ror":"https://ror.org/03q0f4n26","country_code":"US","type":"company","lineage":["https://openalex.org/I87828566"]},{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary A. Stern","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","Market Strategy and Resource Planning, Southern California Edison, Rosemead, 91770 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Market Strategy and Resource Planning, Southern California Edison, Rosemead, 91770 USA","institution_ids":["https://openalex.org/I87828566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5115589290"],"corresponding_institution_ids":["https://openalex.org/I140172145","https://openalex.org/I87828566"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.19796445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"359","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9951000213623047,"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/T12288","display_name":"Optimization and Search Problems","score":0.9950000047683716,"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/subgradient-method","display_name":"Subgradient method","score":0.9676288962364197},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.9529212713241577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.756706953048706},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5666970610618591},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5366695523262024},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5333758592605591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5103990435600281},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.47353312373161316},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4673846960067749},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4653046727180481},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4639432430267334},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4587678015232086},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.4492069482803345},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.44436344504356384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3846225142478943},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.324518620967865}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9676288962364197},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.9529212713241577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.756706953048706},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5666970610618591},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5366695523262024},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5333758592605591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5103990435600281},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.47353312373161316},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4673846960067749},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4653046727180481},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4639432430267334},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4587678015232086},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.4492069482803345},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.44436344504356384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3846225142478943},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.324518620967865},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2008.4626544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1984031944","https://openalex.org/W2007255736","https://openalex.org/W2014562379","https://openalex.org/W2029417680","https://openalex.org/W2074104008","https://openalex.org/W2075357703","https://openalex.org/W2146469260","https://openalex.org/W2798766386","https://openalex.org/W4242209908"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W3183857959","https://openalex.org/W4243844638","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W2363143319","https://openalex.org/W3032916910","https://openalex.org/W2899851694","https://openalex.org/W3207854495","https://openalex.org/W2036724572"],"abstract_inverted_index":{"Lagrangian":[0,30,134],"relaxation":[1,31,135],"has":[2,86],"been":[3,87],"a":[4,36,51,90,127],"powerful":[5],"methodology":[6],"to":[7,32,54,63,137,150,168],"solve":[8],"discrete":[9],"and":[10,20,59,76,115,167,179],"mixed":[11],"integer":[12],"optimization":[13,85,99],"problems":[14,192],"such":[15],"as":[16],"planning,":[17],"scheduling,":[18],"coordination,":[19],"unit":[21],"commitment.":[22],"The":[23,146],"subgradient":[24,37],"method":[25,136],"is":[26,39,50,74,82,113,149,163],"frequently":[27],"used":[28,62],"within":[29],"update":[33],"multipliers,":[34],"where":[35,89],"direction":[38,92],"obtained":[40,95],"by":[41,96],"fully":[42],"minimizing":[43],"the":[44,55,71,80,101,105,110,116,119,132,139,152,156,159,170,176,180,183,194,197],"relaxed":[45,72,102],"problem.":[46,103],"A":[47],"dual":[48,161],"value":[49,162],"lower":[52,106,140],"bound":[53,107,141],"optimal":[56,160],"feasible":[57],"cost,":[58],"can":[60,93],"be":[61,94,122],"evaluate":[64],"solution":[65],"quality.":[66],"Because":[67],"full":[68],"minimization":[69],"of":[70,100,109,118,155,182,196],"problem":[73,81],"time-consuming":[75],"even":[77],"impossible":[78],"when":[79,158],"complex,":[83],"surrogate":[84,133],"developed":[88],"proper":[91],"only":[97],"approximate":[98],"However,":[104],"property":[108],"\u201csurrogate":[111],"dual\u201d":[112],"lost":[114],"convergence":[117,144,181],"algorithm":[120,129,157,184],"cannot":[121],"guaranteed.":[123,145],"This":[124],"paper":[125],"presents":[126],"new":[128],"based":[130],"on":[131,175,189],"resolve":[138],"issue":[142],"with":[143],"key":[147],"idea":[148],"examine":[151],"different":[153,177],"behaviors":[154,178],"overestimated":[164],"or":[165],"underestimated,":[166],"adjust":[169],"estimate":[171],"accordingly.":[172],"Theoretical":[173],"proof":[174],"are":[185],"provided.":[186],"Testing":[187],"results":[188],"manufacturing":[190],"scheduling":[191],"show":[193],"effectiveness":[195],"algorithm.":[198]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}