Journal
OPTIMIZATION LETTERS
Volume 2, Issue 2, Pages 251-265Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-007-0055-4
Keywords
k-splittable flow; Branch and bound; Mixed integer programming; Multicommodity; Throughput
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available