2008 IEEE International Conference on Automation Science and Engineering 2008
DOI: 10.1109/coase.2008.4626544
|View full text |Cite
|
Sign up to set email alerts
|

An improved lagrangian relaxation method for discrete optimization applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…In addition, ELR total system production costs are less expensive for a large system than others. The paper in [33] proposed a new algorithm based on the surrogate Lagrangian relaxation method to resolve the lower bound issue with convergence guaranteed. The method idea is examining the different behaviors of the algorithm as the optimal dual value is overestimated or underestimated.…”
Section: Lagrangian Relaxationmentioning
confidence: 99%
“…In addition, ELR total system production costs are less expensive for a large system than others. The paper in [33] proposed a new algorithm based on the surrogate Lagrangian relaxation method to resolve the lower bound issue with convergence guaranteed. The method idea is examining the different behaviors of the algorithm as the optimal dual value is overestimated or underestimated.…”
Section: Lagrangian Relaxationmentioning
confidence: 99%