期刊
INFORMS JOURNAL ON COMPUTING
卷 24, 期 4, 页码 597-610出版社
INFORMS
DOI: 10.1287/ijoc.1110.0468
关键词
mixed-integer programming; Lagrangean relaxation; capacitated facility location; subgradient optimization; volume algorithm; branch and bound
This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. To guess a primal solution to the Lagrangean dual, we average solutions to the Lagrangean subproblem. Branching decisions are then based on this estimated (fractional) primal solution. Extensive numerical results reveal that the method is much faster and more robust than other state-of-the-art methods for solving the CFLP exactly.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据