An annotated overview of dynamic network flows

B Kotnyek - 2003 - inria.hal.science
The need for more realistic network models led to the development of the dynamic network
flow theory. In dynamic flow models it takes time for the flow to pass an arc, the flow can be …

Optimal control of admission to a queueing system

S Stidham - IEEE Transactions on Automatic Control, 1985 - ieeexplore.ieee.org
Congestion in a queueing system can sometimes be controlled by restricting arrivals, either
by" closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) …

Admissible sets and feedback control for discrete-time linear dynamical systems with bounded controls and states

PO Gutman, M Cwikel - IEEE transactions on Automatic Control, 1986 - ieeexplore.ieee.org
For linear discrete-time dynamical systems, necessary and sufficient conditions are given for
a control sequence belonging to a polyhedral constraint set, to stabilize the system under …

[PDF][PDF] An algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and states

PO Gutman, M Cwikel - IEEE Transactions on Automatic Control, 1987 - academia.edu
An Algorithm to Find Maximal State Constraint Sets for Discrete-Time Linear Dynamical
Systems with Bounded Controls and S Page 1 IEEE TRANSACTIONS ON AUTOMATIC …

On fluidization of discrete event models: observation and control of continuous Petri nets

M Silva, J Júlvez, C Mahulea, CR Vázquez - Discrete Event Dynamic …, 2011 - Springer
As a preliminary overview, this work provides first a broad tutorial on the fluidization of
discrete event dynamic models, an efficient technique for dealing with the classical state …

Dynamic coupling design for nonlinear output agreement and time-varying flow control

M Bürger, C De Persis - Automatica, 2015 - Elsevier
This paper studies the problem of output agreement in networks of nonlinear dynamical
systems under time-varying disturbances, using dynamic diffusive couplings. Necessary …

A linear programming approach to routing control in networks of constrained linear positive systems

H Arneson, C Langbort - Automatica, 2012 - Elsevier
We study routing control in dynamic continuous-time networks in which each node is
described by a linear internally positive system. We derive a linear programming (LP) …

Faster algorithms for the quickest transshipment problem

LK Fleischer - SIAM journal on Optimization, 2001 - SIAM
A transshipment problem with demands that exceed network capacity can be solved by
sending flow in several waves. How can this be done in the minimum number of waves …

Optimal dynamic routing in communication networks with continuous traffic

B Hajek, RG Ogier - Networks, 1984 - Wiley Online Library
New characterizations of optimal state‐dependent routing strategies are obtained for the
continuous traffic network model proposed by Segall for linear cost with unity weighting at …

Constrained regulation of linear continuous-time dynamical systems

M Vassilaki, G Bitsoris - Systems & Control Letters, 1989 - Elsevier
In this paper the Linear Constrained Regulation Problem (LCRP) for continuous-time
dynamical systems is studied. The first part of the paper deals with the existence of linear …