scientific article; zbMATH DE number 7375983

DOI10.4230/LIPICS.ICALP.2018.56zbMath1503.90086arXiv1805.07742MaRDI QIDQ5002731

Hao Fu, Jian Li, Pan Xu

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1805.07742

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stochastic optimizationapproximation algorithmMarkov decision processdynamic programblock policy

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (2)

Stochastic Probing with Increasing Precision ⋮ Adaptive Bin Packing with Overflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive stochastic knapsack problem
• Adaptivity in the stochastic blackjack knapsack problem
• TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards
• Approximate Dynamic Programming
• Submodular Stochastic Probing on Matroids
• An approximation scheme for stochastic linear programming and its application to stochastic integer programs
• Optimal Search for the Best Alternative
• Algorithms and Adaptivity Gaps for Stochastic Probing
• A Stochastic Probing Problem with Applications
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Stochastic combinatorial optimization via poisson approximation
• A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs

This page was built for publication: