Pages that link to "Item:Q1887058"

The following pages link to Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058):

Displaying 22 items.

• Models for video-on-demand scheduling with costs (Q286685) (← links)
• Selfish bin packing with cardinality constraints (Q391143) (← links)
• Online bin stretching with bunch techniques (Q497684) (← links)
• Online unit clustering: Variations on a theme (Q954982) (← links)
• Online interval coloring with packing constraints (Q954991) (← links)
• Class constrained bin covering (Q970104) (← links)
• Class constrained bin packing revisited (Q986543) (← links)
• The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
• Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
• Online bin packing with cardinality constraints resolved (Q2186811) (← links)
• Constructive heuristics for the canister filling problem (Q2276059) (← links)
• Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
• Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
• Improved results for a memory allocation problem (Q2429723) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)
• An efficient algorithm for bin stretching (Q2450663) (← links)
• Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• (Q5009562) (← links)
• (Q5089171) (← links)
• (Q5111695) (← links)
• EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)