The Bruss-Robertson inequality: elaborations, extensions, and applications

From MaRDI portal
(Redirected from Publication:5357635)



Abstract: The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the summands nor requires the equality of their marginal distributions. A review is also given of the applications of the Bruss-Robertson inequality, especially the applications to problems of combinatorial optimization such as the sequential knapsack problem and the sequential monotone subsequence selection problem.












This page was built for publication: The Bruss-Robertson inequality: elaborations, extensions, and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357635)