Pages that link to "Item:Q2768352"

The following pages link to Approximation algorithms for extensible bin packing (Q2768352):

Displaying 20 items.

• A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
• Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
• Approximation algorithms for extensible bin packing (Q880529) (← links)
• On-line scheduling with extendable working time on a small number of machines (Q1007518) (← links)
• Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
• Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
• Linear time-approximation algorithms for bin packing (Q1591548) (← links)
• The price of fixed assignments in stochastic extensible bin packing (Q1757783) (← links)
• Approximating robust bin packing with budgeted uncertainty (Q2285083) (← links)
• Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
• Vector assignment schemes for asymmetric settings (Q2491210) (← links)
• An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
• Optimal preemptive scheduling for general target functions (Q2581760) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Sum-of-squares heuristics for bin packing and memory allocation (Q3507786) (← links)
• (Q3787789) (← links)
• Improved Approximation for Vector Bin Packing (Q4575690) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)
• Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
• Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)