Pages that link to "Item:Q3779988"

The following pages link to Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics (Q3779988):

Displaying 14 items.

• Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
• Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
• Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
• A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
• A note on the average-case behavior of a simple differencing method for partitioning (Q1095035) (← links)
• Expected performance of the shelf heuristic for 2-dimensional packing (Q1121176) (← links)
• Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
• Packing problems (Q1197916) (← links)
• Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
• Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
• The modified differencing method for the set partitioning problem with cardinality constraints (Q1902901) (← links)
• A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
• FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (Q2641215) (← links)