On a realization problem from non-terminal capacity matrices on undirected flow networks

被引:0
|
作者
Tamara, H [1 ]
Sengoku, M
Shinoda, S
Abe, T
机构
[1] Niigata Inst Technol, Dept Informat & Elect Engn, Kashiwazaki, Chiba 9451195, Japan
[2] Niigata Univ, Fac Engn, Niigata 9502181, Japan
[3] Chuo Univ, Fac Sci & Engn, Tokyo 1128551, Japan
关键词
graph theory; flow network; terminal capacity matrix; realization problem; NP-complete;
D O I
10.1002/ecjc.1054
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The problem of realizing a given matrix on an undirected flow network has been studied and various results have been obtained. Most of these results consist of necessary and sufficient conditions for methods of realization in which the maximum good flow between the two points and the matrix components coincide. However, there are cases in which coincidence is not required as long as they are close to each other. In this paper, we consider the realization under certain conditions when values not necessarily realizable as maximum good flows of the flow network are given between two points. First, the upper and lower bounds of the maximum good flow are given. The problem of realization between these two extremes is studied and the necessary and sufficient condition is given. Next, by means of this result, we consider the problem of minimizing the difference between the given value and the maximum good flow in the undirected flow network. A realization method is studied. (C) 2001 Scripta Technica, Electron Comm Jpn Pt 3, 84(12): 28-39, 2001.
引用
收藏
页码:28 / 39
页数:12
相关论文
共 44 条
  • [31] An Adaptive Lagrangian Algorithm for Solving the Capacity and Flow Assignment Problem in Self-Healing ATM Networks
    Gueye, Oumar
    Woungang, Isaac
    Khandaker, Faria
    Alam, A. B. M. Bodrul
    Dhurandher, Sanjay Kumar
    2014 27TH BIENNIAL SYMPOSIUM ON COMMUNICATIONS (QBSC), 2014, : 134 - 138
  • [32] A Fast Non-Decoupled Algorithm to Solve the Load Flow Problem in Meshed Distribution Networks
    Hernandez Fuentes, Hugo Edgardo
    Zarco Soto, Francisco Javier
    Luis Martinez-Ramos, Jose
    2021 INTERNATIONAL CONFERENCE ON SMART ENERGY SYSTEMS AND TECHNOLOGIES (SEST), 2021,
  • [33] On the non-linear problem of fluid distribution networks in quasi-steady condition of flow
    Spena, AR
    Vacca, A
    NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA B-GENERAL PHYSICS RELATIVITY ASTRONOMY AND MATHEMATICAL PHYSICS AND METHODS, 1998, 113 (10): : 1219 - 1230
  • [34] A fast non-decoupled algorithm to solve the load flow problem in meshed distribution networks
    Edgardo Hernandez-Fuentes, Hugo
    Zarco Soto, Francisco Javier
    Luis Martinez-Ramos, Jose
    SUSTAINABLE ENERGY GRIDS & NETWORKS, 2022, 32
  • [35] An exact algorithm for the servers allocation, capacity and flow assignment problem with cost criterion and delay constraint in wide area networks
    Markowski, Marcin
    Kasprzak, Andrzej
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 1, PROCEEDINGS, 2007, 4487 : 442 - +
  • [36] An exact algorithm for the minimal cost gateways location, capacity and flow assignment problem in two-level hierarchical wide area networks
    Ryba, Przemyslaw
    Kasprzak, Andrzej
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 3, PROCEEDINGS, 2007, 4707 : 343 - +
  • [37] Utilization of non-causal uncertainty blocks in the robust flow controller design problem for data-communication networks
    Uenal, Hakki Ulas
    Iftar, Altug
    2008 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS, VOLS 1 AND 2, 2008, : 89 - 94
  • [38] Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks
    Brimberg, Jack
    Todosijevic, Raca
    Urosevic, Dragan
    Mladenovic, Nenad
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162
  • [39] A non-traditional fluid problem: transition between theoretical models from Stokes' to turbulent flow
    Salomone, Horacio D.
    Olivieri, Nestor A.
    Veliz, Maximiliano E.
    Raviola, Lisandro A.
    EUROPEAN JOURNAL OF PHYSICS, 2018, 39 (03)
  • [40] New formalism for characterization of simple non-reciprocal networks free from singularity-point problem
    Hasar, Ugur Cem
    Kaya, Yunus
    Ozturk, Gokhan
    Ozturk, Hamdullah
    Izginli, Mucahit
    Ertugrul, Mehmet
    MEASUREMENT, 2021, 177