Largest-first sequential selection with a sum constraint

DOI10.1016/0167-6377(90)90011-SzbMath0716.90060OpenAlexW1980922404MaRDI QIDQ753676

Philippe Robert, Edward 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)

Related Items (2)

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

Cites Work

• Unnamed Item
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
• Breaking Records and Breaking Boards
• Optimal selection of stochastic intervals under a sum constraint

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