Pages that link to "Item:Q5246083"

The following pages link to Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs (Q5246083):

Displaying 23 items.

• A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• On the complexity of energy storage problems (Q1662159) (← links)
• The TV advertisements scheduling problem (Q1733325) (← links)
• Approximating convex functions via non-convex oracles under the relative noise model (Q1751103) (← links)
• A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences (Q2128769) (← links)
• A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
• (Q5002731) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
• Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
• Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models (Q5219734) (← links)
• A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5891186) (← links)
• Knapsack problems with position-dependent item weights or profits (Q6165391) (← links)
• Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)
• Packing squares independently (Q6652453) (← links)