Results 41 to 50 of about 957 (221)
Multicommodity flows in graphs
Discrete Applied Mathematics, 1983 AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has a integer-valued capacity (≥0), and that qi≥0 (1≤i≤k) are integer-valued demands. When is there a flow for each i, between si and ti and of value qi, such that the total flow through each edge does not exceed its capacity? Ford and Fulkerson solved this
openaire +1 more source
EURASIP Journal on Wireless Communications and Networking, 2008 We consider joint optimization of data routing and resource allocation in multicast multihop wireless networks where interference between links is taken into account.
Crespo PedroM +2 more
doaj +2 more sources
Міжнародний науково-технічний журнал "Проблеми керування та інформатики"The article discusses methodological approaches to the construction of multicommodity hierarchical communication networks and identifies the main tasks of processing and distribution of discrete correspondence flows, which allow to create favorable ...
Володимир Олександрович Васянін +1 more
doaj +1 more source
Traffic flow consideration in design of freight distribution system
IATSS Research, 2010 This study is part of a series of research projects on a distribution system we developed to deal with cases in a state-owned company. It concerns the design of the Public Service Obligation State-owned Company (PSO-SOC) distribution system.
Sutanto Soehodho, Nahry
doaj +1 more source
Resilient overlay design in DWDM systems [PDF]
Yugoslav Journal of Operations Research, 2016 The goal of this work is to design a minimum cost resilient overlay network, where a data network is on top of a transport network. Two major challenges are addressed.
Parodi Cecilia +3 more
doaj +1 more source
Criticality for multicommodity flows
Journal of Combinatorial Theory, Series B, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
Fast Approximation Algorithms for Multicommodity Flow Problems
, 1991 All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [15] uses a fast matrix multiplication algorithm and takes O(k 3:5 n 3 m :5 log(nDU )) time ...
Eva Tardos +11 more
core +1 more source