Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
type: Item
instance of: scholarly article
title: Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
zbMATH Open document ID: 1504.90078
author: Nir Halman
author: Giacomo Nannicini
published in: Mathematical Programming. Series A. Series B
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7606016
zbMATH Keywords: newsvendor problem
zbMATH Keywords: stochastic inventory control
zbMATH Keywords: hardness of approximation
zbMATH Keywords: approximation algorithms
zbMATH Keywords: stochastic dynamic programming
zbMATH Keywords: \(K\)-approximation sets and functions
MaRDI profile type: Publication
full work available at URL: s10107-021-01685-4
OpenAlex ID: W3186080587
cites work: Optimal Inventory Policy
cites work: Q3292915
cites work: Q3376698
cites work: Scheduling to minimize the total compression and late costs
cites work: Approximation of the supply scheduling problem
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
cites work: The complexity of dynamic programming
cites work: The Linear Programming Approach to Approximate Dynamic Programming
cites work: Our Data, Ourselves: Privacy Via Distributed Noise Generation
cites work: Benchmarking optimization software with performance profiles.
cites work: The exact information-based complexity of smooth convex minimization
cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
cites work: PASS approximation: a framework for analyzing and designing heuristics
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
cites work: An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
cites work: Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs
cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
cites work: Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States
cites work: A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
cites work: Q3002852
cites work: Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
cites work: Segmentation problems
cites work: Q3995531
cites work: Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
cites work: Information-based complexity of linear operator equations
cites work: Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem
cites work: An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
cites work: The Accumulation of Risky Capital: A Sequential Utility Analysis
cites work: Q3971990
cites work: Approximate Dynamic Programming
cites work: Multi-stage stochastic optimization applied to energy planning
cites work: Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
cites work: Approximation schemes for a class of subset selection problems
cites work: The newsvendor problem: review and directions for future research
cites work: Q4369442
cites work: The Logic of Logistics
cites work: An approximation scheme for stochastic linear programming and its application to stochastic integer programs
cites work: Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
cites work: Smoothed analysis of algorithms
cites work: Q4040428
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Q4782696
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Dynamic version of the economic lot size model
DOI: 10.1007/S10107-021-01685-4
description: scientific article; zbMATH DE number 7606016