Approximate linear programming for networks: average cost bounds (Q342031): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654022 / rank
 
Normal rank
Property / zbMATH Keywords
 
queueing network
Property / zbMATH Keywords: queueing network / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate dynamic programming
Property / zbMATH Keywords: approximate dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2015.04.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2466174699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Optimal Queuing Network Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming via a Smoothed Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polynomial approximations in Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Linear Programming for Average Cost MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New linear program performance bounds for queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Performance Bounds for Markov Chains With Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neuro-Dynamic Programming: An Overview and Recent Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise Stochastic Optimal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Relaxations and Duality in Stochastic Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control Techniques for Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic safety-stocks for asymptotic optimality in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of two interacting service stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value iteration and optimization of multiclass queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target-Pursuing Scheduling and Routing Policies for Multiclass Queueing Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance bounds for queueing networks and scheduling policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing LP Bounds for Queueing Networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:55, 12 July 2024

scientific article
Language Label Description Also known as
English
Approximate linear programming for networks: average cost bounds
scientific article

    Statements

    Approximate linear programming for networks: average cost bounds (English)
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    queueing network
    0 references
    approximate dynamic programming
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references