Abstract
In this paper we describe a new type of network flow problems that basically consists of the classical transshipment problem with the following extensions: (1) The replication of a network by producing subnetworks with identical structure, being linked by so-called linking arcs; (2) the objective function terms related to the linking arcs are non-differentiable nonlinear functions. By using a networks-specialized implementation of a linearly constrained nonlinear programming algorithm described elsewhere, we report the computational performance of the new concept of independent superbasic sets that allows to obtain in parallel independent pieces of the solution at each iteration.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
