\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

Vertex control of flows in networks

Abstract Related Papers Cited by
  • We study a transport equation in a network and control it in a single vertex. We describe all possible reachable states and prove a criterion of Kalman type for those vertices in which the problem is maximally controllable. The results are then applied to concrete networks to show the complexity of the problem.
    Mathematics Subject Classification: 34B45, 93B05, 47N70.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
SHARE

Article Metrics

HTML views() PDF downloads(261) Cited by(0)

Access History

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return