Computing robust basestock levels
type: Item
instance of: scholarly article
title: Computing robust basestock levels
zbMATH Open document ID: 1151.90498
author: Nuri Özbay
author: Daniel Bienstock
published in: Discrete Optimization
publication date: 2008-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5358798
zbMATH Keywords: robust optimization
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.12.002
OpenAlex ID: W2152575352
cites work: Universal-stability results and performance bounds for greedy contention-resolution protocols
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: The Price of Robustness
cites work: A Robust Optimization Approach to Inventory Theory
cites work: Q4228491
cites work: A calculus for network delay. I. Network elements in isolation
cites work: (s, S) Policies for a Dynamic Inventory Model with Stochastic Lead Times
cites work: An Efficient Algorithm for Computing Optimal (s, S) Policies
cites work: Inventory management under highly uncertain demand
cites work: The Distribution Free Newsboy Problem: Review and Extensions
cites work: Geometric algorithms and combinatorial optimization.
cites work: Q5332976
cites work: Distribution Free Procedures for Some Inventory Models
cites work: A Single-Unit Decomposition Approach to Multiechelon Inventory Systems
cites work: Q4040221
cites work: Q5332977
cites work: On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
cites work: Q5358751
DOI: 10.1016/J.DISOPT.2006.12.002
description: scientific article; zbMATH DE number 5358798