In this last chapter, we summarize the volume’s contents, provide a review of the software tools available that were presented in the various chapters, and provide some open questions for future research and development. Chapter 1 : Introduction G(V, E)Chapter 2 : Problem Overview Ω(G(V,E))Chapter 3 : Mathematical Models and Properties of Queues G(V )Chapter 4 : Transportation and Loss Queues G(E)Chapter 5 : Open Queueing Network Algorithms f(G(V,E))Chapter 6 : Closed Queueing Network Algorithms f(G(V,E,N))Chapter 7 : Optimal Resource Allocation Problems G(V∗)Chapter 8 : Optimal Routing Problems G(E∗)Chapter 9 : Optimal Topology Problems G(V, E)∗
CITATION STYLE
Smith, J. M. G. (2018). Final Coda. In Springer Series in Operations Research and Financial Engineering (pp. 527–533). Springer Nature. https://doi.org/10.1007/978-3-319-78822-7_10
Mendeley helps you to discover research relevant for your work.