scientific article; zbMATH DE number 910873

MaRDI QIDQ4886047zbMATH OpenFDO

Authors George S. Lueker

Publication date 13 October 1996

zbMATH Keywords

average-case behavioron-line-greedyzero-one knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• scientific article; zbMATH DE number 3904330
• Greedy algorithms for the minimization knapsack problem: average behavior
• scientific article; zbMATH DE number 4047112
• Stochastic on-line knapsack problems

Cited in

(15)

• Online knapsack with resource augmentation
• Stochastic on-line knapsack problems
• Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
• Online knapsack problem under concave functions
• Average-case performance of rollout algorithms for knapsack problems
• Online removable knapsack problem under convex function
• The primal and dual greedy algorithms for the knapsack problem: the average behavior
• 2D knapsack: packing squares
• scientific article; zbMATH DE number 4047112 (Why is no real title available?)
• scientific article; zbMATH DE number 4057285 (Why is no real title available?)
• 2D knapsack: packing squares
• Online removable knapsack with limited cuts
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Online Knapsack Problem Under Concave Functions
• Online minimization knapsack problem

This page was built for publication:

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