In traditional multi-commodity flow theory, the task is to send a certain amount of each
commodity from its start to its target node, subject to capacity constraints on the edges …

In traditional multi-commodity flow theory, the task is to send a certain amount of each
commodity from its start to its target node, subject to capacity constraints on the edges …

The classical network flow theory allows decomposition of flow into several chunks of
arbitrary sizes traveling through the network on different paths. In the first part of this article …

We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in
the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set …

Given a graph with a source and a sink node, the NP-hard maximum k-splittable s, t-flow (M
k SF) problem is to find a flow of maximum value from s to t with a flow decomposition using …

Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (M k
SF) problem is to find a flow of maximum value with a flow decomposition using at most k …

Let G=(V, E) be a graph with a source node s and a sink node t,| V|= n,| E|= m. For a given
number k, the Maximum k-Splittable Flow problem (MkSF) is to find an s, t-flow of maximum …

In this paper we present a column generation model and a branch-and-price algorithm for a
multicommodity k-splittable flow problem. The k-splittable flow is an extension of the …

We deal with a generalization of the Minimum path colouring problem, k-Edge disjoint path
systems colouring: given a graph G and a set of pairs of vertices of G, the task is to connect …

In classical network flow theory, flow being sent from a source to a destination may be split
into a large number of chunks traveling on different paths through the network. This effect is …