Results 31 to 40 of about 381 (184)
Uniform multicommodity flows in the hypercube with random edge‐capacities
, 2016 We give two results for multicommodity flows in thed-dimensional hypercubeQdwithindependent random edge-capacities distributed like a random variableCwhereP[C>0]>1/2.Firstly, with high probability asd→∞, the network can support simultaneous ...
Withers, P +5 more
core +2 more sources
Uniform multicommodity flows in random networks
, 2015 Given a network 𝒩, and a collection 𝒱 of unordered pairs of vertices in 𝒩, a corresponding uniform multicommodity flow F of volume φ consists of simultaneous flows of volume φ of unique commodities between each pair of vertices in ...
Paul Withers, Withers, Paul
core +1 more source
Penyelesaian masalah minimal multicommodity flows dengan algoritma dekomposisi [PDF]
, 1999 ABSTRAK \ud Multicommodity flows merupakan salah satu model pada program linier untuk menentukan biaya minimal beberapa komoditas dari suinber (s) ke tujuan (t).
Kusriyati, Ani
core
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source
Multicommodity Flow in Polynomial Time
CoRR, 2009 The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations.
Raymond Hemmecke +2 more
openaire +2 more sources
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
The Canadian Journal of Chemical Engineering, Volume 104, Issue 2, Page 569-593, February 2026.Abstract Component failures in integrated heating and cooling networks impact reliable energy supply. This work studies reliability of heating and cooling systems constrained either by the annualized capital cost (ACC) or by the annualized total cost (ATC).
Arman Khani, Vladimir Mahalec
wiley +1 more source
Кібернетика та комп'ютерні технологіїIntroduction. In the problems of the distribution and routing of flows in communication networks, the input data is vehicle routes or data transmission channels.
Volodymyr Vasyanin +2 more
doaj +1 more source
High-Accuracy Multicommodity Flows via Iterative Refinement [PDF]
The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain management, etc.
Chen, Li, Ye, Mingquan
core +1 more source
Underground Freight Transportation for Package Delivery in Urban Environments
Networks, Volume 87, Issue 1, Page 83-105, January 2026.ABSTRACT The use of underground freight transportation (UFT) is gaining attention because of its ability to quickly move freight to locations in urban areas while reducing road traffic and the need for delivery drivers. Since packages are transported through the tunnels by electric motors, the use of tunnels is also environmentally friendly. We examine
Sarah Powell +2 more
wiley +1 more source