On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
, 2003 We give a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of Greedy algorithm for maximum edge ...
Leighton, F. Thomson +3 more
core
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows
, 1993 In this paper we consider the worst case ratio between the capacity of min-cuts and the value of max-flow for multicommodity flow problems. We improve the best known bounds for the mincut max-flow ratio for multicommodity flows in undirected graphs, by ...
Serge A. Plotkin +2 more
core +1 more source
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities. [PDF]
J Glob Optim, 2023 Nagurney A +3 more
europepmc +1 more source
On fractional multicommodity flows and distance functions
Discrete Mathematics, 1988 The authors establish some results on fractional and integral solutions to multicommodity flow problems. The following is proven. Let \(G=(V,E)\) be a planar bipartite graph. There exist subsets \(W_ 1,W_ 2,...,W_ t\) of V so that for each pair \(v'\), \(v''\) of vertices on the boundary of G, the distance of \(v'\) and \(v''\) in G is equal to the ...
C.A.J. Hurkens (Cor) +2 more
openaire +3 more sources
The Cut Cone, L¹ Embeddability, Complexity and Multicommodity Flows
, 1990 A finite metric (or more properly semimetric) on n points is a non-negative vector d = (dij) 1 ≤ i < j ≤ n that satisfies the triangle inequality: dij ≤ dik + d jk. The L 1 (or Manhattan)distance |x | − y 1 | between two vectors x = (xi) and y = (yi)
David Avis, Michel Deza
core
Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks. [PDF]
Arab J Sci Eng, 2022 Djaker AB, Kechar B, Afifi H, Moungla H.
europepmc +1 more source
Criticality for multicommodity flows [PDF]
, 2020 For k ≥ 1, the k-commodity flow problem is, we are given k pairs of vertices in a graph G, and we ask whether there exist k flows in the graph, where • the ith flow is between the ith pair of vertices, and has total value one; and • for each edge e, the ...
Paul Seymour
core
Multicommodity routing optimization for engineering networks. [PDF]
Sci Rep, 2022 Lonardi A, Putti M, De Bacco C.
europepmc +1 more source
Solving the multicommodity flow problem using an evolutionary routing algorithm in a computer network environment. [PDF]
PLoS One, 2023 Farrugia N, Briffa JA, Buttigieg V.
europepmc +1 more source
Um modelo de fluxo em rede para solução de problemas de distribuição de produtos compostos [PDF]
, 2005 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Neste trabalho é proposto um modelo linear de Fluxo em Redes para o problema de minimização de custos de produção e ...
Machado, Catia Maria dos Santos
core