Control and optimization methods in communication network problems

DOI10.1109/9.35806zbMath0709.94667OpenAlexW2017001890MaRDI QIDQ3495262

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)

Related Items (9)

A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network ⋮ Nonlinear neural networks for solving the shortest path problem ⋮ Average flow constraints and stabilizability in uncertain production-distribution systems ⋮ Compartmental flow control: decentralization, robustness and optimality ⋮ Guaranteed cost control for multi-inventory systems with uncertain demand. ⋮ A new algorithm for finding the shortest paths using PCNNs ⋮ 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

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