An Approximate Method for Optimization of a Network Flow With Inverse Linear Constraints
Vassil Sgurev, Atanas T. Atanassov (1998)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Capacity and Maximal Value of the Network Flow with Multiplicative Constraints”
An Approximate Method for Optimization of a Network Flow With Inverse Linear Constraints
Quasi polymatroidal flow networks.
Kochol, M. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Mathematical foundation of flow of glaciers and large ice masses
Kolumban Hutter (1985)
Banach Center Publications
Similarity:
On MHD fluctuating flow in slip-flow regime with variable suction
V. M. Soundalgekar (1971)
Matematički Vesnik
Similarity:
Optimization of an SMD placement machine and flows in parametric networks
Katarína Cechlárová, Tamás Fleiner (2011)
Kybernetika
Similarity:
In the minimization of the number of subtours made by the insertion head of an SMD placement machine a variant of the network flow problem arose. In a network with vertices and arcs a set of arcs (parametrized arcs) is given. The task is to find a flow of a given size such that the maximum of flow values along the arcs from is minimized. This problem can be solved by a sequence of maximum flow computations in modified networks where the capacities of the parametrized arcs are...
Nonexistence of Coherent Structures in Two-dimensional Inviscid Channel Flow
H. Kalisch (2012)
Mathematical Modelling of Natural Phenomena
Similarity:
Two-dimensional inviscid channel flow of an incompressible fluid is considered. It is shown that if the flow is steady and features no horizontal stagnation, then the flow must necessarily be a parallel shear flow.
Unsteady stratified flow past a cylinder
D. V. Krishna (1966)
Applicationes Mathematicae
Similarity:
The inverse maximum flow problem considering norm
Adrian Deaconu (2008)
RAIRO - Operations Research
Similarity:
The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...