.png){kind=icon}
Return
About Lagrangian methods in integer optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3447-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is well-known that the Lagrangian dual of an Integer Linear Program (ILP) provides the same bound as a continuous relaxation involving the convex hull of all the optimal solutions of the Lagrangian relaxation. It is less often realized that this equivalence is effective, in that basically all known algorithms for solving the Lagrangian dual either naturally compute an (approximate) optimal solution of the convexified relaxation, or can be modified to do so. After recalling these results we elaborate on the importance of the availability of primal information produced by the Lagrangian dual within both exact and approximate approaches to the original (ILP), using three optimization problems with different structure to illustrate some of the main points.
Keywords:
Lagrangian dual
integer linear programs
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveVaccines as a tool to estimate the burden of severe influenza in children of low-resourced areas (November 30–December 1, 2012, Les Pensieres, Veyrier-du-Lac, France).png)
Vaccine
VaccineIF0
PREAI
ShareSave
View more