Multicommodity flows belong to the class of primal block-angular problems. An efficient interior-point method has already been developed for linear and quadratic network optimization problems. It solved normal equations, using sparse Cholesky factorizations for diagonal blocks, and a preconditioned conjugate gradient for linking constraints. In this work we extend this procedure, showing that t...

The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities, time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions, defined on edges, are nonlinear and dep...

In this paper, a tabu search heuristic is combined with slope scaling to solve a discrete depot location problem, known as the multicommodity location problem with balancing requirements. Although the uncapacitated version of this problem has already been addressed in the literature, this is not the case for the more challenging capacitated version, where each depot has a fixed and finite capac...

The network design problem considered in this paper provides the basis for the solution of many interesting and practical engineering problems, of which one notable example is the link capacity expansion problem of existing communication networks. We are particularly interested in the possibility of using this problem as a subproblem when solving the planning and design problem of multiservice ...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...

We consider the routing problem in wireline, packet-switched communication networks. We cast our optimal routing problem in a multicommodity network flow optimization framework. Our cost function is related to the congestion in the network, and is a function of the flows on the links of the network. The optimization is over the set of flows in the links corresponding to the various destinations...

We consider the problem of topology control and routing of unsplittable flows in wireless optical networks with point-to-point links. Such networks could form a backbone for either a cellular network or hierarchical ad hoc network. Each backbone node has a limited number of transceivers with which to establish links to neighbors. The objective is to form links and come up with routes so as to m...

We study several multi-criteria undirected network design problems with node costs and lengths with all problems related to the node costs Multicommodity Buy at Bulk (MBB) problem in which we are given a graph G = (V,E), demands {dst : s, t ∈ V }, and a family {cv : v ∈ V } of subadditive cost functions. For every s, t ∈ V we seek to send dst flow units from s to t on a single path, so that