✦ LIBER ✦

A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks

✍ Scribed by K.D. Glazebrook; J. Niño‐Mora

Book ID: 110379561
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 185 KB
Volume: 92
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018922412074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A delay-partitioning projection approach

A delay-partitioning projection approach to stability analysis of stochastic Markovian jump neural networks with randomly occurred nonlinearities

✍ Duan, Jianmin; Hu, Manfeng; Yang, Yongqing; Guo, Liuxiao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 475 KB

A novel approach to stability analysis f

A novel approach to stability analysis for switched positive linear systems

✍ Zhao, Xudong; Yu, Qiang; Zhang, Junfeng; Li, Zhicheng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 700 KB

l1-gain performance analysis and positiv

l1-gain performance analysis and positive filter design for positive discrete-time Markov jump linear systems: A linear programming approach

✍ Zhu, Shuqian; Han, Qing-Long; Zhang, Chenghui 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 585 KB

A stability concept for matrix game opti

A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis

✍ Marvin D. Troutt 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 336 KB

A Unified Lyapunov Approach to Analysis

A Unified Lyapunov Approach to Analysis of Oscillations and Stability for Systems With Piecewise Linear Elements

✍ Tingshu Hu; Thibodeau, T.; Teel, A.R. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 457 KB

An algorithm to perform a complete right

An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem

✍ Alejandro Crema 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We designed and implemented an algorithm to solve the continuous right-hand side parametric 0±1-Integer Linear Programming (ILP) problem, that is to solve a family of 0±1-ILP problems in which the problems are related by having identical objective and matrix coecients. Our algorithm works by choosin