Results 111 to 120 of about 957 (221)
Introduction. The article discusses mathematical models of problems of constructing circular routes of vehicles in a multicommodity hierarchical network.
Volodymyr Vasyanin, Liudmyla Ushakova
doaj +1 more source
A Near-Optimal Energy Management Mechanism Considering QoS and Fairness Requirements in Tree Structure Wireless Sensor Networks. [PDF]
Tai KY +4 more
europepmc +1 more source
An efficient tree-based model for multicommodity flow problems
International audienceRouting optimization in telecommunication networks is based on the solution of multicommodity flow problems. We propose a new way to model multicommodity flow problems.
Ben-Ameur, Walid +2 more
core
Integrated Optimization of Production Scheduling and Haulage Route Planning in Open-Pit Mines
In mining, deposits are divided into blocks, forming the basis for open-pit mine planning, covering production and haulage route planning. Current studies often stage optimization and lack the consideration of road capacity, leading to suboptimal ...
Changyou Xu +5 more
doaj +1 more source
Circuit Switching: A Multicommodity Flow Based Approach.
In this paper, we consider the problem of routing virtual circuits in a network. In particular, given a set of request pairs in a network, we wish to route a path between each pair so that very few paths use the same wire.
Satish Rao, Tom Leighton
core
Local convex hulls for a special class of integer multicommodity flow problems. [PDF]
Lin Z, Kwan RSK.
europepmc +1 more source
Flows of Substances in Networks and Network Channels: Selected Results and Applications. [PDF]
Dimitrova ZI.
europepmc +1 more source
Epidemiological data analysis of viral quasispecies in the next-generation sequencing era. [PDF]
Knyazev S +3 more
europepmc +1 more source
Unsplittable Multicommodity Flows in Outerplanar Graphs
Full version of IPCO 2025 ...
David Alemán-Espinosa +1 more
openaire +2 more sources
Simple and Fast Distributed Multicommodity Flow Algorithm
In this paper, we present a simple and fast distributed algorithm for approximately solving the minimum-cost multicommodity flow problem. If there exists a flow that satisfies all of the demands, our algorithm runs in O(m 2 ffl \Gamma2 log n ...
Anil Kamath, Serge Plotkin, Omri Palmon
core

