This paper presents an exact decomposition approach for an employee days-off scheduling problem of an homogeneous workforce under serval realistic days-off scheduling constraints. These constraints include the following: (1) each employee is assigned to three or four consecutive days-off per...

In this paper, the delay probability of the original Nagel and Schreckenberg model is modified to simulate one-lane traffic flow. The delay probability of a vehicle depends on its corresponding gap. According to simulation results, it has been found that the structure of the fundamental diagram...

A decentralized random algorithm for flow distribution in complex networks is proposed. The aim is to maintain the maximum flow while satisfying the flow limits of the nodes and links in the network. The algorithm is also used for flow redistribution after a failure in (or attack on) a complex...

We present a fast (∼ O (N3)) algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of the selected spins. For the...

Given a networkN=(V,A,c), a sources εV, a. sinkt εV and somes —t cuts and suppose each element of the capacity vectorc can be changed with a cost proportional to the changes, the inverse problem of minimum cuts we study here is to change the original capacities with the least total cost...