We consider a network of pipelines where the flow is controlled by a number of compressors. The consumer demand is described by desired boundary traces of the system state. We present conditions that guarantee the existence of compressor controls such that after a certain finite time the state at th
β¦ LIBER β¦
Locating Sources to Meet Flow Demands in Undirected Networks
β Scribed by Kouji Arata; Satoru Iwata; Kazuhisa Makino; Satoru Fujishige
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 260 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper deals with the problem of finding a minimum-cost vertex subset S in an undirected network such that for each vertex v we can send d v units of flow from S to v. Although this problem is NP-hard in general, H.
π SIMILAR VOLUMES
Flow control in gas networks: Exact cont
β
M. Gugat; M. Herty; V. Schleper
π
Article
π
2010
π
John Wiley and Sons
π
English
β 263 KB
NEURAL NETWORK APPROACH TO LOCATING ACOU
β
J.C. Spall; J.L. Maryak; M.S. Asher
π
Article
π
1998
π
Elsevier Science
π
English
β 166 KB
Problems of where to locate p-sinks in a
β
Kaoru Watanabe; Masakazu Sengoku; Hiroshi Tamura
π
Article
π
1996
π
John Wiley and Sons
π
English
β 648 KB
The global network of plate boundaries c
β
L.-E. Ricou
π
Article
π
1998
π
John Wiley and Sons
π
English
β 197 KB
The global network of plate boundaries can be divided into two discrete subnetworks containing the spreading and subduction boundaries, respectively. We advocate that this division is a stable pattern that derives from consistency rules in rigidβplate rotations. Subduction is distributed along a sin