Largest-first sequential selection with a sum constraint

DOI10.1016/0167-6377(90)90011-SzbMATH Open0716.90060OpenAlexW1980922404MaRDI QIDQ753676FDOQ753676

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

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

zbMATH Keywords

order statisticsbin packingsequential selectionsubset sum maximization

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Cites Work

• Breaking Records and Breaking Boards
• Optimal selection of stochastic intervals under a sum constraint
• Title not available (Why is that?)
• 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
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
• An unexpected limit of expected values

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)