Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Strongly polynomial dual simplex methods for the maximum flow problem
Mathematical Programming: Series A and B
Reliable and economic resource allocation in an unreliable flow network
Computers and Operations Research
Optimal resource assignment to maximize multistate network reliability for a computer network
Computers and Operations Research
Information Sciences: an International Journal
Computers and Operations Research
| Hi-index | 0.01 |
This paper considers resource allocation decisions in an unreliable multi-source multi-sink flow network, which applies to many real-world systems such as electric and power systems, telecommunications, and transportation systems. Due to uncertainties of components in such an unreliable flow network, transmitting resources successfully and economically through the unreliable flow network is of concern to resource allocation decisions at resource-supplying (source) nodes. We study the resource allocation decisions in an unreliable flow network for a range of demand configurations constrained by demand-dependent and demand-independent cost considerations under the reliability optimization objective. Solutions to these problems can be obtained by computing the resource allocation for each demand configuration independently. In contrast, we pursue an updating scheme that eludes time-consuming enumeration of flow patterns, which is necessary in independent computation of resource allocations for different demand configurations. We show that updating is attainable under both demand-independent and demand-dependent cost constraints when demand incurs an incremental change, and demonstrate the proposed updating scheme with numerical examples