期刊
INFORMS JOURNAL ON COMPUTING
卷 22, 期 2, 页码 314-325出版社
INFORMS
DOI: 10.1287/ijoc.1090.0348
关键词
local search; integer programming; fixed-charge network flow; multicommodity
资金
- Air Force Office of Scientific Research [FA9550-07-1-0177, FA9550-09-1-0061]
W e develop a solution approach for the fixed-charge network flow (FCNF) problem that produces provably high-quality solutions quickly. The solution approach combines mathematical programming algorithms with heuristic search techniques. To obtain high-quality solutions, it relies on neighborhood search with neighborhoods that involve solving carefully chosen integer programs derived from the arc-based formulation of FCNF. To obtain lower bounds, the linear programming relaxation of the path-based formulation of FCNF is used and strengthened with cuts discovered during the neighborhood search. The solution approach incorporates randomization to diversify the search and learning to intensify the search. Computational experiments demonstrate the efficacy of the proposed approach.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据