Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

157

CCO
2001
Springer

157views Combinatorics» more CCO 2001»

Lagrangian Relaxation

15 years 10 months ago

Lagrangian Relaxation

Download www.optimization-online.org

Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modiﬁed Lagrangian relaxation which used in (linear) combinatorial optimization with equality constraints generates an optimal integer solution. We call this new concept semi-Lagrangian relaxation and illustrate its practical value by solving large-scale instances of the p-median problem.

Claude Lemaréchal

Real-time Traffic

CCO 2001 | Combinatorial Optimization | Combinatorics | Lagrangian Relaxation | Modiﬁed Lagrangian Relaxation |

claim paper

Related Content

» MRF Inference by kFan Decomposition and Tight Lagrangian Relaxation

» Adaptive price update in distributed Lagrangian relaxation protocol

» Lagrangian Relaxation Neural Networks for Job Shop Scheduling

» Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation

» A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

» A revisit to floorplan optimization by Lagrangian relaxation

» Gate sizing for crosstalk reduction under timing constraints by Lagrangian relaxation

» Floorplan area minimization using Lagrangian relaxation

» RealWorld Extensions to a Production Scheduling Algorithm Based on Lagrangian Relaxation

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CCO
Authors	Claude Lemaréchal

Comments (0)