Control and optimization methods in communication network problems

DOI10.1109/9.35806MaRDI QIDQ3495262zbMATH OpenOpenAlexFDO

Authors Anthony Ephremides, Sergio Verdú

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.35806

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(9)

• A new algorithm for finding the shortest paths using PCNNs
• Nonlinear neural networks for solving the shortest path problem
• Compartmental flow control: decentralization, robustness and optimality
• Guaranteed cost control for multi-inventory systems with uncertain demand.
• Average flow constraints and stabilizability in uncertain production-distribution systems
• Robust control strategies for multi--inventory systems with average flow constraints
• Denumerable controlled Markov chains with average reward criterion: Sample path optimality
• The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
• A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network

This page was built for publication: Control and optimization methods in communication network problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495262)