Results 91 to 100 of about 957 (221)
Convex multicommodity flow problems : a bidual approach
, 2005 The topic of this dissertation, within the subfield of mathematics known as optimization, is the development of a new dual ascent method for convex multicommodity flow problems. Convex multicommodity flow problems arize in many different routing problems
Hägglöf, Kristoffer,
core
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
Generalized Benders Decomposition to solve a nonlinear routing problem with queueing delay goal function [PDF]
International Journal of Electronics and TelecommunicationsWe address the multicommodity flow problem with a nonlinear goal function modeling queueing delay. It is well-known that linear programming solvers perform better than those used for nonlinear programming.
Kacper Kozerski, Andrzej Karbowski
doaj +1 more source
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
, 1995 In this paper, we present a new interior-point based polynomial algorithm for the multicommodity flow problem and its variants. Unlike all previously known interior point algorithms for multicommodity flow that have the same complexity for approximate ...
Anil Kamath, Omri Palmon
core
Reduction from three-dimensional discrete tomography to multicommodity flow problem
, 2005 The reduction from two-dimensional-discrete tomography to max-flow problem is well-known [Gale, A theorem on flows in networks, Pacific J. Math. 7 (1957) 1073–1082].
Gerard, Y., Gérard, Yan, Y. Gerard
core +1 more source
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization, 2013 A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy +2 more
doaj +1 more source
Dynamic multicommodity flow schedules [PDF]
, 1981 Some new results in the scheduling of dynamic multicommodity flows in data communication networks are presented. A new performance measure for effective delivery of backlogged data to their destinations is defined and the solution to the resulting ...
Feit, Adam, Adam Feit
core
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting.
, 2011 This paper introduces a new problem, involving the optimal location of a limited number of gateways on the nodes of an uncapacitated network. A multicommodity flow, where each commodity is of single-origin-single-destination type, moves on the network ...
Maurizio Bruglieri +10 more
core +1 more source