Largest-first sequential selection with a sum constraint

DOI10.1016/0167-6377(90)90011-SMaRDI QIDQ753676zbMATHOpenAlexFDO

Authors Philippe Robert, E. G. jun. Coffman, Guy Fayolle, Philippe Jacquet

Publication date 1990

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(90)90011-s

zbMATH Keywords

order statisticsbin packingsequential selectionsubset sum maximization

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Recommendations

• Optimal Sequential selection of n random variables under a constraint
• A note on the selection of random variables under a sum constraint
• scientific article; zbMATH DE number 1959613
• Optimal selection of stochastic intervals under a sum constraint
• On a class of optimal stopping problems with mixed constraints

Cites work

• scientific article; zbMATH DE number 4033058 (Why is no real title available?)
• Breaking Records and Breaking Boards
• Optimal selection of stochastic intervals under a sum constraint
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem

Cited in

(3)

• Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
• An unexpected limit of expected values
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem

This page was built for publication: Largest-first sequential selection with a sum constraint

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