Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand

DOI10.1109/TAC.2009.2034204zbMath1368.90018WikidataQ59341785 ScholiaQ59341785MaRDI QIDQ4978653

Dario Bauso, Franco Blanchini, Raffaele Pesenti

Publication date: 25 August 2017

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Design techniques (robust design, computer-aided design, etc.) (93B51) Existence of solutions for minimax problems (49J35)

Related Items (5)

Attainability in Repeated Games with Vector Payoffs ⋮ Opinion Dynamics in Social Networks through Mean-Field Games ⋮ Compartmental flow control: decentralization, robustness and optimality ⋮ Approachability with constraints ⋮ The linear saturated decentralized strategy for constrained flow control is asymptotically optimal

This page was built for publication: Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand