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, ...

Subgradient methods (SM) have long been the preferred way to solve large-scale Nondifferentiable Optimization problems, such as those arising from the solution of Lagrangian duals of hard combinatorial optimization problems. Although other methods exist that show a significantly higher convergence rate in some circumstances, SM have certain unique advantages that may make them competitive under...

ÐThe problem of allocating high-volume multimedia files on a virtual circuit network with the objective of maximizing channel throughput (and minimizing data transmission time) is addressed. The problem is formulated as a multicommodity flow problem. We present both the optimal and suboptimal solutions to the problem using novel approaches. Index TermsÐFile allocation, virtual circuit, cut, max...

Abstract This article addresses the problem of finding work assignments for employees within a given time horizon in company using multicommodity network flow model. The human resource allocation is defined by actual manpower demands different periods which may vary during periods. investigation focuses on when workers should be called in-house and how long to satisfy demands, while also comply...

This study deals with the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem arising in topology discovery of local network. While the traditional Capacitated Minimum Spanning Tree (CMST) problem deals with only traffic capacity constraint of a port of a source node, and Delay-Constrained Minimum Spanning Tree (DCMST) considers only the maximum end-to-end delay constraint, th...

We address the algorithmic complexity of a profit maximization problem in capacitated, undirected networks. We are asked to price a set of m capacitated network links to serve a set of n potential customers. Each customer is interested in purchasing a network connection that is specified by a simple path in the network and has a maximum budget that we assume to be known to the seller. The goal ...

Throughput is a main performance objective in communication networks. This paper considers fundamental maximum throughput routing problem-the all-or-nothing multicommodity flow (ANF) problem - arbitrary directed graphs and the practically relevant but challenging setting where demands can be (much) larger than edge capacities. Hence, addition to assigning requests valid flows for each routed co...

By introducing quadratic penalty terms, a convex nonseparable quadratic network program can be reduced to an unconstrained optimization problem whose objective function is a piecewise quadratic and continuously differentiable function. A conjugate gradient method is applied to the reduced problem and its convergence is proved. The computation exploits the special network data structures origina...

We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...

We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...