Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005)
Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 15–29 (2001)
Badics, T.: GENRMF, ftp://dimacs.rutgers.edu/pub/netflow/generators/network/genrmf/
Baier, G.: Flows with path restrictions. Ph.D. Thesis, Technisce Universitat Berlin, Cuvillier Verlag Gottingen (2003)
Baier G., Köhler E. and Skutella M. (2005). On the k-splittable flow problem. Algorithmica 42: 231–248
Bienstock D. and Raskina O. (2002). Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. Ser. B. 91(3): 479–492
Caramia, M., Sgalambro, A.: On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms (2007, in press). doi:10.1016/j.jda.2007.03.001
Chuzhoy, J., Naor, J.: New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th Annual ACM Symposium of Theory of Computing, Chicago, IL, pp. 28–34 (2004)
Dinitz Y., Garg N. and Goemans M.X. (1999). On the single-source unsplittable flow problem. Combinatorica 19(1): 17–41
Goldfarb D. and Grigoriadis M. (1988). A computational comparison of the Dinic and Network Simplex methods for maximum flow. Ann. Oper. Res. 13: 83–123
Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. Ph.D. Thesis, MIT, Cambridge (1996)
Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 68–77 (1996)
Koch, R., Skutella, M., Spenke, I.: Approximation and complexity of k-splittable flows. Technical Report (2005)
Kolliopoulos, S.G.: Improved approximation algorithms for unsplittable flow problems. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 426–435 (1997)
Kolliopoulos S.G. (2005). Minimum-cost single-source splittable flow. Inf. Process. Lett. 9(1): 15–18
Martens M. and Skutella M. (2006). Flows on few paths: algorithms and lower bounds. Networks 48(2): 68–76
Martens M. and Skutella M. (2006). Length-bounded and dynamic k-splittable flows. Oper. Res. Proc. 2005: 297–302
Raghavan P. and Thompson C. (1987). Randomized rounding: a technique for provable good algorithms and algorithmic proofs. Combinatorica 7(4): 365–374
Matula D.W. and Shahrokhi F. (1990). The maximum concurrent flow problem. J. ACM 37: 318–334
Skutella M. (2002). Approximating the single source unsplittable min-cost flow problem. Math. Program. 91: 493–514
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Caramia, M., Sgalambro, A. An exact approach for the maximum concurrent k-splittable flow problem. Optimization Letters 2, 251–265 (2008). https://doi.org/10.1007/s11590-007-0055-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-007-0055-4