Pages that link to "Item:Q4456057"

The following pages link to Approximation schemes for ordered vector packing problems (Q4456057):

Displaying 32 items.

• There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
• An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
• Selfish bin packing with cardinality constraints (Q391143) (← links)
• Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• Bin packing with rejection revisited (Q848845) (← links)
• Online interval coloring with packing constraints (Q954991) (← links)
• Class constrained bin covering (Q970104) (← links)
• Class constrained bin packing revisited (Q986543) (← links)
• Bin packing with controllable item sizes (Q1004389) (← links)
• The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
• Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
• Online bin packing with cardinality constraints resolved (Q2186811) (← links)
• Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
• Offline black and white bin packing (Q2355707) (← links)
• Sequential vector packing (Q2378514) (← links)
• Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
• Bin packing with general cost structures (Q2429476) (← links)
• Improved results for a memory allocation problem (Q2429723) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)
• Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
• Improved Approximation for Vector Bin Packing (Q4575690) (← links)
• (Q4607900) (← links)
• (Q5111695) (← links)
• Efficient algorithms for orthogonal packing problems (Q5413218) (← links)
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints (Q5443386) (← links)
• Several methods of analysis for cardinality constrained bin packing (Q5918534) (← links)
• Several methods of analysis for cardinality constrained bin packing (Q5970788) (← links)
• EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
• Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)