Maximal flow problem in a network with a variable structure

J. Grabowski; E. Skubalska

The search session has expired. Please query the service again.

Displaying similar documents to “Maximal flow problem in a network with a variable structure”

Capacity and Maximal Value of the Network Flow with Multiplicative Constraints

Vassil Sgurev, Mariana Nikolova (1997)

The Yugoslav Journal of Operations Research

Similarity:

Quasi polymatroidal flow networks.

Kochol, M. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

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:

Maximizing residual capacity in connection-oriented networks.

Walkowiak, Krzysztof (2006)

Journal of Applied Mathematics and Decision Sciences

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

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

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

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal Przewozniczek, Krzysztof Walkowiak (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...

The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow

Adrian Deaconu (2008)

The Yugoslav Journal of Operations Research

Similarity:

The Flow Networks Approach to Decision Analysis in Construction Industry

Goran Ćirović, Darko Plamenac (2007)

The Yugoslav Journal of Operations Research

Similarity:

The Distribution of Time for Clark’S Flow and Risk Assessment for the Activities of Pert Network Structure

Duško Letić, Vesna Jevtić (2009)

The Yugoslav Journal of Operations Research

Similarity: