Towards the minimum-cost control of target nodes in directed networks with linear dynamics.
Leitao GaoGuangshe ZhaoGuoqi LiLei DengFei ZengPublished in: J. Frankl. Inst. (2018)
Keyphrases
- minimum cost
- directed networks
- np hard
- network flow
- approximation algorithms
- network flow problem
- spanning tree
- control system
- capacity constraints
- dynamic model
- special case
- control theory
- communication delays
- dynamic programming
- scheduling problem
- shortest path
- dynamical systems
- computational complexity
- optimal control
- linear systems
- evolutionary algorithm