Probabilistic analysis of a heuristics for the dual bin packing problem

Authors:
Dean P. Foster;Rakesh V. Vohra
Affiliations:
Univ. of Chicago, Chicago, IL;The Ohio State Univ., Columbus
Venue:
Information Processing Letters
Year:
1989

Citing 0
Cited 3

Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations

ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Bin completion algorithms for multicontainer packing, knapsack, and covering problems

Journal of Artificial Intelligence Research
An exact algorithm for the dual bin packing problem

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract