Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Inventory Policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize the total compression and late costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the supply scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dynamic programming / 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: Our Data, Ourselves: Privacy Via Distributed Noise Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact information-based complexity of smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PASS approximation: a framework for analyzing and designing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turning Big data into tiny data: Constant-size coresets for <i>k</i>-means, PCA and projective clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based complexity of linear operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accumulation of Risky Capital: A Sequential Utility Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-stage stochastic optimization applied to energy planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for a class of subset selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The newsvendor problem: review and directions for future research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logic of Logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for stochastic linear programming and its application to stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank

Latest revision as of 15:05, 30 July 2024

scientific article
Language Label Description Also known as
English
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
scientific article

    Statements

    Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (English)
    0 references
    0 references
    0 references
    24 October 2022
    0 references
    newsvendor problem
    0 references
    stochastic inventory control
    0 references
    hardness of approximation
    0 references
    approximation algorithms
    0 references
    stochastic dynamic programming
    0 references
    \(K\)-approximation sets and functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers