Buffer allocation for a class of nonlinear stochastic knapsack problems
type: Item
instance of: scholarly article
title: Buffer allocation for a class of nonlinear stochastic knapsack problems
zbMATH Open document ID: 0836.90124
DOI: 10.1007/BF02038860
author: J. McGregor Smith
author: Nikhil Chikhale
published in: Annals of Operations Research
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K20
zbMATH DE Number: 830146
zbMATH Keywords: nonlinear, stochastic knapsack problems
zbMATH Keywords: network design
zbMATH Keywords: queueing networks
zbMATH Keywords: overall buffer constraint
zbMATH Keywords: sensitivity analysis
MaRDI profile type: Publication
cites work: Approximate analysis of exponential tandem queues with blocking
cites work: Approximate analysis of exponential queueing systems with blocking
cites work: Combining routing and buffer allocation problems in series-parallel queueing networks
cites work: An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: Asymptotic behavior of the expansion method for open finite queueing networks
cites work: The generalized expansion method for open finite queueing networks
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: An Approximation Method for Open Restricted Queueing Networks
cites work: Simple Bounds for Finite Single-Server Exponential Tandem Queues
cites work: Simple bounds and monotonicity results for finite multi-server exponential tandem queues
description: scientific article; zbMATH DE number 830146