Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We construct integrality gap instances for SDP relaxation of the Maximum Cut and the Sparsest Cut problems. It is well-known that… 
Highly Cited
2009
Highly Cited
2009
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh… 
2009
2009
We construct integrality gap instances for SDP relaxation of the M AXI UM CUT and the SPARSEST CUT problems. If the triangle… 
Highly Cited
2008
Highly Cited
2008
It has been an intensively sought-after goal to achieve high throughput and fairness in wireless scheduling through simple and… 
Highly Cited
2007
Highly Cited
2007
This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by… 
Highly Cited
2000
Highly Cited
2000
We consider a multi-period inventory/distribution planning problem (MPIDP) in a one-warehouse multiretailer distribution system… 
Review
1985
Review
1985
The femtosecond intraband relaxation of hot carriers in GaAs, Al0.32Ga0.68As, and the multiple-quantum-well structure is studied… 
Highly Cited
1977
Highly Cited
1977
Two methods are introduced for reducing additive noise in approximately piecewise constant images. In the first method, the…