Results 31 to 40 of about 957 (221)
Multicommodity flows in planar graphs
Journal of Combinatorial Theory, Series B, 1981 Suppose that G is a graph, and (si, ti) (1≤i≤k) are pairs of vertices; and that each edge has a real-valued capacity (≥0), and that qi≥0 (1≤i≤k) are realvalued 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 when k=1, and
Haruko Okamura, Paul D. Seymour
openaire +1 more source
A Scaling Algorithm for Multicommodity Flow Problems [PDF]
Operations Research, 1998 We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a finite number of scaling phases. The basis of the algorithm is simple and consists of iteratively detecting and sending flow around negative cost cycles.
Schneur, Rina., Orlin, James B.
openaire +3 more sources
The Klein bottle and multicommodity flows [PDF]
Combinatorica, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Matroids and Multicommodity Flows
European Journal of Combinatorics, 1981 The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalities between the maximum feasible packing of certain circuits of a graph and the minimum capacity of certain cocircuits, and thus may both be expressed in matroid terms. We study the matroids in which a similar “k-commodity flow theorem” holds. (Thus for k =
openaire +1 more source
Fast Approximation Algorithms for Multicommodity Flow Problems
, 1995 Fast Approximation Algorithms for Multicommodity Flow ...
Stein, C. +5 more
core +1 more source
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source
Benders decomposition for local access network design with two technologies [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We have worked with the local access network design problem with two cable technologies. This is an optimization problem in graphs that consists of linking an origin node to a set of terminal nodes which have a flow demand.
C. D. Randazzo, H. P. L. Luna, P. Mahey
doaj +2 more sources
Discrete Dynamics in Nature and Society, 2021 This paper provides an integrated planning methodology for the optimization of port rotation direction and fleet deployment for container liner shipping routes with consideration of demand uncertainty.
Jingxu Chen +3 more
doaj +1 more source
Energy Reports, 2023 The conventional vehicle fleet worldwide has contributed to the degradation of air quality due to CO2emissions. Consequently, it has migrated from internal combustion to electric vehicles (EVs).
Miguel Campaña, Esteban Inga
doaj +1 more source