Abstract Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze disruptions in a production setting. Using bilevel optimization framework, minimize the total manufacturer interested finding optimal disruption The problem constitutes convex network flow program under chance ...

environment throughout the evacuation network. Although both have proven reasonably effective as capacity-increasing measures (for accelerating the evacuation process), their combination can enhance performance further. Solving this design problem with lane reversal and crossing elimination, however, poses a great challenge, because of the complex mutual connectivity requirement imposed by the ...

Hsiao, M.-T.T. and A.A. Lazar, Optimal decentralized flow control of Markovian queueing networks with multiple controllers, Performance Evaluation 13 (1991) 181-204. A Markovian queueing network model is used to derive decentralized flow control mechanisms in computer communication networks with multiple controllers. Under the network optimization criterion, finding the optimal decentralized fl...

Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the le...

In the minimization of the number of subtours made by an SMD placement machine the following variant of the minimum cost flow problem arised: in a network with n vertices and m arcs a set F of arcs (parametrized arcs) is given and the cost of the flow is equal to the maximum of flow values along the arcs from F . This problem can be solved by a sequence of maximum flow computations in modified ...

Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic flow problems, called bridge problem. The bridge problem has practical importance and raises interesting theoretical issues. We show that the bridge problem is NP-complete. Traditional static flow techniques for solving dy...