The multi-commodity network flow problem (MCNF) consists in routing a set of commodities through capacitated at minimum cost and is relevant for containers liner shipping networks. As commodity transit times are often critical factor, the literature has introduced hard limits on times. In practical contexts, however, these may fail to provide sufficient flexibility since routes with even tiny d...

Multiprotocol Label Switching (MPLS) can improve the routing efficiency of Internet Protocol (IP) networks through its intrinsic Traffic Engineering (TE) capabilities. In this paper, a centralised and a distributed virtual-flow routing algorithms are proposed, which aggregate IP flows entering the MPLS domain and optimally partition them among virtual flows that are routed on multiple paths. Th...

Derivang the min imum and maximum global snapshots is very useful f o r some error detection problems in distributed programs. Several researchers, e.g., Groselj, Chen and W u , have shown that the min imum and maximum global snapshot problems are lineart ime reducible to the max imum constant-ratio network flow (MCNF) problem, here defined as the well-known maximum network flow problem with m ...

The methodology used for the prediction of trips through the allocation of these according to the origin-destination (OD) survey, constitutes a traditional methodology to cover the demand of existing transport between the zones of analysis. When the transportation system fulfills the characteristics of a network (topology, routed arcs, nodes with commodity supply and demand, etc.) in addition, ...

The methodology used for the prediction of trips through the allocation of these according to the origin-destination (OD) survey, constitutes a traditional methodology to cover the demand of existing transport between the zones of analysis. When the transportation system fulfills the characteristics of a network (topology, routed arcs, nodes with commodity supply and demand, etc.) in addition, ...