Optimizing flow rates in a queueing network with side constraints
From MaRDI portal
Recommendations
Cites work
- A class of chance constrained network optimization problems
- Convex separable optimization is not much harder than linear optimization
- Dioïds and semirings: Links to fuzzy sets and other applications
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Stochastic convexity and its applications
Cited in
(7)- Distribution network design: Selection and sizing of congested connections
- A logistics problem: a non-markovian queueing network model and algorithm
- Solving convex optimization with side constraints in a multi-class queue by adaptive c rule
- Minimizing Congestion in Single-Source, Single-Sink Queueing Networks
- A class of chance constrained network optimization problems
- Optimizing utilization under response time constraints
- A Markovian queueing transportation network problem
This page was built for publication: Optimizing flow rates in a queueing network with side constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266636)