.png){kind=icon}
返回
About Lagrangian methods in integer optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3447-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Lagrangian dual
integer linear programs
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
Influence of ring blasting pattern on the safety of nearby underground structures环形爆破模式对附近地下结构安全的影响.png)
Sādhanā
SādhanāIF0
PREAI
分享收藏分享收藏Vaccines 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)Vaccine
VaccineIF0
PREAI
分享收藏
查看更多内容