System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight [An article from: Computers and Operations Research]

Author - Y.-K. Lin ... [Goo?] [Posters]

This Digital Book item from Elsevier was reviewed on 4-Nov-2008.

Search ISBN:B000PDU3B8 offer from Abebooks or used books from Alibris. System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight [An article from: Computers and Operations Research] Reference Book. Classifications : Subjects Arts & Photography Biographies & Memoirs Business & Investing Children's Books Comics & Graphic Novels Computers & Internet Cooking, Food & Wine Entertainment Gay & Lesbian Health, Mind & Bod . Click the following link to view the cover of System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight [An article from: Computers and Operations Research].

Related topics: Subjects. Arts & Photography. Children´s Books. Entertainment. Gay & Lesbian. Health, Mind & Body. History. Home & Garden. Law. Medicine.

1) Digital Book System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight [An article from: Computers and Operations Research] by Elsevier. This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
The system capacity of a single-commodity flow network is the maximum flow from the source to the destination. This paper discusses the system capacity problem for a two-commodity multistate flow network composed of multistate components (edges and nodes). In particular, each component has both capacity and cost attributes. Both types of commodity, which are transmitted through the same network simultaneously, consume the capacities of edges and nodes differently. That is, the capacity weight varies with types of commodity, edges and nodes. We first define the system capacity as a 2-tuple vector and then propose a performance index, the probability that the upper bound of the system capacity is a given pattern subject to the budget constraint. Such a performance index can be easily computed in terms of upper boundary vectors. An efficient algorithm based on minimal cuts is thus presented to generate all upper boundary vectors. The manager can apply this performance index to measure the quality level of supply-demand systems such as computer, logistics, power transmission, telecommunication and urban traffic systems.¤

Page Updated: Robert N. Goolsby, 2-Dec-2008, , B8B-8

System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight [An article from: Computers and Operations Research], Book, Image © Elsevier

Search: Elsevier, Book Posters, Book Art