Lagrangian relaxation

Known as: Dual decomposition, Lagrangian 
In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper formulates the price-based unit commitment (PBUC) problem based on the mixed integer programming (MIP) method. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper proposes an enhanced adaptive Lagrangian relaxation (ELR) for a unit commitment (UC) problem. ELR consists of adaptive… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The steel-making process, including steel-making and continuous casting, is usually the bottleneck in iron and steel production… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present approximation algorithms for the metric uncapacitated facility location problem and the metric <italic>k</italic… (More)
Is this relevant?
Review
2001
Review
2001
Lagrangian relaxation is a tool to find upper bounds on a given (arbitrary) maximization problem. Sometimes, the bound is exact… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents an application of a combined the Genetic Algorithms (GA’s) and Lagrangian Relaxation (LR) method for the unit… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table I
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Scheduling is one of the most basic but the most difficult problems encountered in the manufacturing industry. Generally, some… (More)
  • table 1
Is this relevant?