The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
Adrian Deaconu (2008)
The Yugoslav Journal of Operations Research
Similarity:
Adrian Deaconu (2008)
The Yugoslav Journal of Operations Research
Similarity:
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...
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Vassil Sgurev, Atanas T. Atanassov (1998)
The Yugoslav Journal of Operations Research
Similarity:
Kochol, M. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Vassil Sgurev, Mariana Nikolova (1997)
The Yugoslav Journal of Operations Research
Similarity:
Walkowiak, Krzysztof (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
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...
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
P. Mahey, Thai Q. Phong, H. P. L. Luna (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We study a continuous version of the capacity and flow assignment problem (CFA) where the design cost is combined with an average delay measure to yield a non convex objective function coupled with multicommodity flow constraints. A separable convexification of each arc cost function is proposed to obtain approximate feasible solutions within easily computable gaps from optimality. On the other hand, DC (difference of convex functions) programming can be used to compute accurate upper...