期刊
OPTIMIZATION LETTERS
卷 2, 期 2, 页码 251-265出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-007-0055-4
关键词
k-splittable flow; Branch and bound; Mixed integer programming; Multicommodity; Throughput
We consider the maximization of a multicommodity flow throughput in presence of constraints on the maximum number of paths to be used. Such an optimization problem is strongly NP-hard, and is known in the literature as the maximum routable demand fraction variant of the k-splittable flow problem. Here we propose an exact approach based on branch and bound rules and on an arc-flow mixed integer programming formulation of the problem. Computational results are provided, and a comparison with a standard commercial solver is proposed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据