Pages that link to "Item:Q5167762"

The following pages link to Optimal Analysis of Best Fit Bin Packing (Q5167762):

Displaying 21 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Max-min bin packing algorithm and its application in nano-particles filling (Q528368) (← links)
• Online bin packing with overload cost (Q831684) (← links)
• Algorithmic analysis of priority-based bin packing (Q831745) (← links)
• Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
• The optimal absolute ratio for online bin packing (Q1741486) (← links)
• A general bin packing game: interest taken into account (Q1750357) (← links)
• Best fit bin packing with random order revisited (Q1979457) (← links)
• On bin packing with clustering and bin packing with delays (Q2234744) (← links)
• The tight absolute bound of First Fit in the parameterized case (Q2355708) (← links)
• A-shaped bin packing: Worst case analysis via simulation (Q2386612) (← links)
• Batched bin packing revisited (Q2398649) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Using weight decision for decreasing the price of anarchy in selfish bin packing games (Q2424774) (← links)
• (Q2957914) (← links)
• Online Colored Bin Packing (Q3453281) (← links)
• (Q4949805) (← links)
• A new and improved algorithm for online bin packing (Q5009562) (← links)
• Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
• A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)