Displaying similar documents to “An Approximate Method for Optimization of a Network Flow With Inverse Linear Constraints”

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 n vertices and m arcs a set F 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 F 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...

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...

Flow Polyhedra and Resource Constrained Project Scheduling Problems

Alain Quilliot, Hélène Toussaint (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper aims at describing the way Flow machinery may be used in order to deal with Resource Constrained Project Scheduling Problems (RCPSP). In order to do it, it first introduces the Timed Flow Polyhedron related to a RCPSP instance. Next it states several structural results related to connectivity and to cut management. It keeps on with a description of the way this framework gives rise to a generic Insertion operator, which enables programmers to design greedy and local search...

On bounded channel flows of viscoelastic fluids

Marshall J. Leitman, Epifanio G. Virga (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

We show that the smooth bounded channel flows of a viscoelastic fluid exhibit the following qualitative feature: Whenever the channel is sufficiently wide, any bounded velocity field satisfying the homogeneous equation of motion is such that if the flow stops at some time, then the flow is never unidirectional throughout the channel. We first demonstrate the qualitative property of the bounded channel flows. Then we show explicitly how a piecewise linear approximation of a relaxation...