Displaying similar documents to “The inverse maximum flow problem considering l∞ norm”

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

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

Separable convexification and DCA techniques for capacity and flow assignment problems

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