Results 11 to 20 of about 957 (221)
The Parameterised Complexity of Integer Multicommodity Flow [PDF]
The Integer Multicommodity Flow problem has been studied extensively in the literature. However, from a parameterised perspective, mostly special cases, such as the Disjoint Paths problem, have been considered. Therefore, we investigate the parameterised complexity of the general Integer Multicommodity Flow problem. We show that the decision version of
Hans L. Bodlaender +4 more
core +9 more sources
Multicommodity Flow Problems with Commodity Compatibility Relations [PDF]
We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required.
Lin Zhiyuan, Kwan Raymond
doaj +2 more sources
Optimization problems arising in telecommunications are often large-scale nonlinear problems. Usually their big size is generated mainly by their linear parts but the existence of small or medium nonlinear parts prevents us from directly tackling them ...
Paweł M. Białoń
doaj +2 more sources
Product Multicommodity Flow in Wireless Networks [PDF]
Revised version of "Capacity-Delay Scaling in Arbitrary Wireless Networks" submitted to the IEEE Transactions on Information Theory. Part of this work appeared in the Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2005, and the Internation Symposium on Information Theory (ISIT ...
Ritesh Madan +2 more
openaire +4 more sources
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
Optimal Decision-Making in Fractional Multi-commodity Flow Problem in Uncertainty Environment
This paper seeks to address the multi-commodity flow problem in uncertainty conditions, in which the objective function of the problem is of fractional type. The cost coefficients and capacities of the problem are uncertain.
Salim Bavandi, Seyed Hadi Nasseri
doaj +1 more source
On the core of the multicommodity flow game [PDF]
In citepapa, Papadimitriou formalized the notion of routing stability in BGP as the following coalitional game theoretic problem: Given a network with a multicommodity flow satisfying node capacity and demand constraints, the payoff of a node is the total flow originated or terminated at it. A payoff allocation is in the core if and only if there is no
Evangelos Markakis 0001, Amin Saberi
openaire +1 more source
Multicommodity flow and circuit switching [PDF]
Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion.
Tom Leighton +2 more
openaire +1 more source
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP.
Mounira Groiez +3 more
doaj +1 more source
Multi-Objective Gate Allocation Problem Based on Multi-Commodity Network Flow Model
Gate allocation has always been a fundamental but critical issue in the daily operation of airports, which is related to service quality and schedule efficiency.
Jinghan Du +3 more
doaj +1 more source

