Control and optimization methods in communication network problems

DOI10.1109/9.35806zbMATH Open0709.94667OpenAlexW2017001890MaRDI QIDQ3495262FDOQ3495262

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

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)