Approximate Linear programming for a queueing control problem
From MaRDI portal
Cites work
- A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees
- A Queueing Reward System with Several Customer Classes
- Admission policies for a two class loss system
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Approximate Dynamic Programming via a Smoothed Linear Program
- Approximate dynamic programming. Solving the curses of dimensionality
- Approximate linear programming for networks: average cost bounds
- Capacity Management in Rental Businesses with Two Customer Bases
- Comparing LP Bounds for Queueing Networks
- Decomposable Markov decision processes: A fluid optimization approach
- Dynamic Bid Prices in Revenue Management
- Generalized polynomial approximations in Markovian decision processes
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- Linear parametric programming—A brief survey
- Network revenue management with inventory-sensitive bid prices and customer choice
- New linear program performance bounds for queueing networks
- On a piecewise-linear approximation for network revenue management
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On optimal call admission control in resource-sharing system
- On the approximate linear programming approach for network revenue management problems
- On the equivalence between some discrete and continuous optimization problems
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- Performance bounds for queueing networks and scheduling policies
- Re-entrant lines
- Re-solving stochastic programming models for airline revenue management
- Reductions of approximate linear programs for network revenue management
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Stability of generalized Jackson networks
- The Linear Programming Approach to Approximate Dynamic Programming
- Time-Sharing Service Systems. I
- Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management
This page was built for publication: Approximate Linear programming for a queueing control problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979439)