Optimal selection of stochastic intervals under a sum constraint

From MaRDI portal
Publication:4726037

DOI10.2307/1427427zbMath0616.90035OpenAlexW4230933265MaRDI QIDQ4726037

Leopold Flatto, Edward G. jun. Coffman, Richard R. Weber

Publication date: 1987

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427427




Related Items (20)

Sequential selection of random vectors under a sum constraintMarkov Decision Problems Where Means Bound VariancesAverage-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relationsA unified approach for solving sequential selection problemsLongest Increasing Subsequences of Randomly Chosen Multi-Row ArraysLogarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal RewardsAsymptotic expansions and strategies in the online increasing subsequence problemResource dependent branching processes and the envelope of societiesA central limit theorem for the optimal selection process for monotone subsequences of maximum expected lengthOn-line selection of an acceptable pairThe BRS-inequality and its applicationsAsymptotics and renewal approximation in the online selection of increasing subsequenceDiffusion approximations in the online increasing subsequence problemQuickest online selection of an increasing subsequence of specified sizeLargest-first sequential selection with a sum constraintSequential selection of a monotone subsequence from a random permutationOn sequential selection and a first passage problem for the Poisson processProbabilistic analysis of a heuristic for the dual bin packing problemSequential selection of an increasing sequence from a multidimensional random sample.Optimal rules for the sequential selection of monotone subsequences of maximum expected length




This page was built for publication: Optimal selection of stochastic intervals under a sum constraint