Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
From MaRDI portal
(Redirected from Publication:5013571)
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Stochastic programming (90C15) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Strongly polynomial FPTASes for monotone dynamic programs
- Fully polynomial time approximation schemes for stochastic dynamic programs
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
- A computationally efficient FPTAS for convex stochastic dynamic programs
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
Cites work
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
- A deterministic polynomial-time approximation scheme for counting knapsack solutions
- A faster FPTAS for \#Knapsack
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
- Algorithms for Scheduling Independent Tasks
- An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications
- Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
- Approximation schemes for a class of subset selection problems
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Bi-criteria path problem with minimum length and maximum survival probability
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Faster FPTASes for counting and random generation of knapsack solutions
- Fully polynomial time approximation schemes for stochastic dynamic programs
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- On the complexity of energy storage problems
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs
- Sampling-based approximation algorithms for multistage stochastic optimization
- Scheduling deteriorating jobs to minimize makespan
- The logic of logistics. Theory, algorithms, and applications for logistics management
- The Recognition of Series Parallel Digraphs
- The TV advertisements scheduling problem
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(5)- Strongly polynomial FPTASes for monotone dynamic programs
- Knapsack problems with position-dependent item weights or profits
- Theory and methodology of time-dependent scheduling: past, present and future
- Fifty years of research in scheduling -- theory and applications
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
This page was built for publication: Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013571)
