On the Multi-Commodity Flow with convex objective function: Column-Generation approaches
Guillaume Beraud-Sudreau, Lucas L\'etocart, Youcef Magnouche, S\'ebastien Martin

TL;DR
This paper develops column-generation algorithms for a convex multi-commodity flow problem, optimizing network traffic distribution with convex arc costs, applicable to telecommunication networks with efficient computational performance.
Contribution
It introduces novel column-generation methods for solving both splittable and unsplittable convex multi-commodity flow problems with diverse convex cost functions.
Findings
Effective algorithms for convex multi-commodity flow problems.
Applicable to networks with convex, possibly nondifferentiable costs.
Demonstrated computational efficiency in complex network scenarios.
Abstract
The purpose of this work is to develop an algorithmic optimization approach for a capacitated Multi-Commodity flow problem, where the objective is to minimize the total link costs, where the cost of each arc increases convexly with its utilization. This objective is particularly relevant in telecommunication networks, where device performance can deteriorate significantly as the available bandwidth on a link becomes limited. By optimizing this convex function, traffic is efficiently distributed across the network, ensuring optimal use of available resources and preserving capacity for future demands. This paper describes the Convex Multi-Commodity Flow Problem and presents methodologies to solve both its Splittable and Unsplittable variants. In the Splittable version, flows can be fractionally distributed across multiple paths, while in the Unsplittable version, each commodity must be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Advanced Optical Network Technologies · Complexity and Algorithms in Graphs
