Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,728,791 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Approximation theory
Augmented Lagrangian method
Constrained optimization
Image segmentation
Expand
Broader (1)
Convex optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet
Steven S. W. Lee
,
P. Tseng
,
Alice Chen
Future generations computer systems
2012
Corpus ID: 30029875
Highly Cited
2009
Highly Cited
2009
SDP Integrality Gaps with Local ell_1-Embeddability
Subhash Khot
,
Rishi Saket
50th Annual IEEE Symposium on Foundations of…
2009
Corpus ID: 15749510
We construct integrality gap instances for SDP relaxation of the Maximum Cut and the Sparsest Cut problems. It is well-known that…
Expand
Highly Cited
2009
Highly Cited
2009
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Dong-Hoon Shin
,
S. Bagchi
ACM Interational Symposium on Mobile Ad Hoc…
2009
Corpus ID: 16814064
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh…
Expand
2009
2009
SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot
Subhash Khot
,
Rishi Saket
2009
Corpus ID: 16089298
We construct integrality gap instances for SDP relaxation of the M AXI UM CUT and the SPARSEST CUT problems. If the triangle…
Expand
Highly Cited
2008
Highly Cited
2008
Maximizing Utility via Random Access without Message Passing
Jiaping Liu
,
Yung Yi
,
Alexandre Proutière
,
M. Chiang
,
H. Poor
2008
Corpus ID: 15931217
It has been an intensively sought-after goal to achieve high throughput and fairness in wireless scheduling through simple and…
Expand
Highly Cited
2007
Highly Cited
2007
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
Junhua Zhu
,
Shan Chen
,
B. Bensaou
,
Ka-Lok Hung
IEEE INFOCOM - 26th IEEE International…
2007
Corpus ID: 2577058
This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by…
Expand
Highly Cited
2000
Highly Cited
2000
A Lagrangian relaxation approach to multi-period inventory/distribution planning
Jung-Ug Kim
,
Yeong-Dae Kim
Journal of the Operational Research Society
2000
Corpus ID: 62674013
We consider a multi-period inventory/distribution planning problem (MPIDP) in a one-warehouse multiretailer distribution system…
Expand
Highly Cited
1999
Highly Cited
1999
A transmission-constrained unit commitment method in power system scheduling
C. Tseng
,
S. Oren
,
Carol S. Cheng
,
Chao-an Li
,
A. Svoboda
,
Raymond B. Johnson
Decision Support Systems
1999
Corpus ID: 14754704
Review
1985
Review
1985
Ultrafast relaxation dynamics of photoexcited carriers in GaAs and related compounds
A. Taylor
,
David J. Erskine
,
C. Tang
1985
Corpus ID: 36629067
The femtosecond intraband relaxation of hot carriers in GaAs, Al0.32Ga0.68As, and the multiple-quantum-well structure is studied…
Expand
Highly Cited
1977
Highly Cited
1977
Iterative Enhancemnent of Noisy Images
A. Lev
,
S. Zucker
,
A. Rosenfeld
IEEE Transactions on Systems, Man and Cybernetics
1977
Corpus ID: 13634792
Two methods are introduced for reducing additive noise in approximately piecewise constant images. In the first method, the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE