Results 1 to 10 of about 381 (184)
Stable Multicommodity Flows [PDF]
Algorithms, 2013 We extend the stable flow model of Fleiner to multicommodity flows. In addition to the preference lists of agents on trading partners for each commodity, every trading pair has a preference list on the commodities that the seller can sell to the buyer. A
Tamás Király, Julia Pap
exaly +7 more sources
Unsplittable Multicommodity Flows in Outerplanar Graphs
Lecture Notes in Computer ScienceFull version of IPCO 2025 ...
David Alemán-Espinosa, Kumar Nikhil
exaly +3 more sources
Dynamic Multicommodity Contraflow Problem with Asymmetric Transit Times
Journal of Applied Mathematics, 2022 A maximum dynamic multicommodity flow problem concerns with the transportation of several different commodities through the specific source-sink path of an underlying capacity network with the objective of maximizing the sum of commodity flows within a ...
Shiva Prakash Gupta +2 more
doaj +1 more source
Complex System Modeling and Simulation, 2021 Introducing InterSatellite Links (ISLs) is a major trend in new-generation Global Navigation Satellite Systems (GNSSs). Data transmission scheduling is a crucial problem in the study of ISL management.
Jungang Yan +3 more
doaj +1 more source
Designing optimal networks for multicommodity transport problem
Physical Review Research, 2021 Designing and optimizing different flows in networks is a relevant problem in many contexts. While a number of methods have been proposed in the physics and optimal transport literature for the one-commodity case, we lack similar results for the ...
Alessandro Lonardi +3 more
doaj +1 more source
Nauka ta progres transportu, 2020 Purpose. The purpose of the article is to develop a universal unified parallel synchronous algorithm for the implementation of tasks for calculation of maximum one- and multicommodity flows, as well as the creation of a software complex that provides the
V. V. Skalozub +2 more
doaj +1 more source
On the core of the multicommodity flow game [PDF]
Decision Support Systems, 2003 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
Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals
International Journal of Mathematics and Mathematical Sciences, 2020 The multicommodity flow problem arises when several different commodities are transshipped from specific supply nodes to the corresponding demand nodes through the arcs of an underlying capacity network.
Urmila Pyakurel +3 more
doaj +1 more source
Multicommodity flow and circuit switching [PDF]
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 2002 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
The Parameterised Complexity of Integer Multicommodity Flow
CoRR, 2023 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
openaire +5 more sources