Results 21 to 30 of about 957 (221)
A hybrid algorithm for large-scale non-separable nonlinear multicommodity flow problems
Journal of Algorithms & Computational Technology, 2023 We propose an approach for large-scale non-separable nonlinear multicommodity flow problems by solving a sequence of subproblems which can be addressed by commercial solvers.
Trung Hieu Tran +2 more
doaj +1 more source
Faster approximate multicommodity flow using quadratically coupled flows [PDF]
, 2012 Original manuscript May 8, 2012The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows.
Gary L. Miller +5 more
core +1 more source
Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach
IEEE Transactions on Quantum Engineering, 2020 We consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum Internet, where the repeaters may perform a probabilistic Bell-state measurement and we may impose a minimum end-to-end
Kaushik Chakraborty +3 more
doaj +1 more source
A multi-criteria multi-commodity flow model for analysing transportation networks
Operations Research Perspectives, 2020 This article proposes a novel multi-criteria multi-commodity network flow (MCMCNF) model to help transport planners and other analysts holistically assess different types of transportation systems (TS).
Bayan Bevrani +3 more
doaj +1 more source
The Truck Platooning Routing Optimization Model Based on Multicommodity Network Flow Theory
Journal of Advanced Transportation, 2023 Truck platooning has been identified as an emerging and promising operational technology with the advantages of fuel consumption savings and carbon emissions reductions.
Zexi Zhang
doaj +1 more source
Multicommodity flows and cuts in polymatroidal networks [PDF]
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012 We consider multicommodity flow and cut problems in {\em polymatroidal} networks where there are submodular capacity constraints on the edges incident to a node. Polymatroidal networks were introduced by Lawler and Martel and Hassin in the single-commodity setting and are closely related to the submodular flow model of Edmonds and Giles; the well-known
Chandra Chekuri +3 more
openaire +2 more sources
The Quickest Multicommodity Flow Problem [PDF]
, 2002 Traditionally, flows over time are solved in time expanded networks which contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the time expanded network.
Lisa Fleischer, Martin Skutella
openaire +1 more source
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths [PDF]
Yugoslav Journal of Operations Research, 2019 The paper presents a comparison between three approaches to solving the length-bounded maximum multicommodity flow problem with unit edge-lengths.
Borisovsky Pavel +4 more
doaj +1 more source
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem [PDF]
, 2003 International audienceThis work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication networks.
Rivano, Hervé +2 more
core +1 more source
On resilience of multicommodity dynamical flow networks [PDF]
53rd IEEE Conference on Decision and Control, 2014 Dynamical flow networks with heterogeneous routing are analyzed in terms of stability and resilience to perturbations. Particles flow through the network and, at each junction, decide which downstream link to take on the basis of the local state of the network.
Gustav Nilsson +2 more
openaire +4 more sources