Pages that link to "Item:Q1289396"
From MaRDI portal
The following pages link to New linear program performance bounds for queueing networks (Q1289396):
Displaying 17 items.
- Approximate linear programming for networks: average cost bounds (Q342031) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- Performance bounds for scheduling queueing networks (Q1198582) (← links)
- A characterisation of (max,+)-linear queueing systems (Q1587110) (← links)
- Uncertain convex programs: randomized solutions and confidence levels (Q1769067) (← links)
- Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks (Q1945444) (← links)
- A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks (Q1960307) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Performance Analysis of Queueing Networks via Robust Optimization (Q3098770) (← links)
- A linear programming problem in separable closed queueing networks (Q3826347) (← links)
- Performance bounds for queues via generating functions (Q4540199) (← links)
- Comparing LP Bounds for Queueing Networks (Q4974818) (← links)
- Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
- New linear program performance bounds for closed queueing networks (Q5954608) (← links)
- Reductions of non-separable approximate linear programs for network revenue management (Q6167751) (← links)
