Pages that link to "Item:Q2400930"
From MaRDI portal
The following pages link to Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930):
Displaying 47 items.
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Vector scheduling with rejection on a single machine (Q1743644) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Online circle and sphere packing (Q2419121) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- (Q5002616) (← links)
- A tight lower bound for the online bounded space hypercube bin packing problem (Q5024670) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- (Q5089171) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Online bin packing of squares and cubes (Q5925713) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
- Three-Bar Charts Packing Problem (Q6090762) (← links)
- A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority (Q6092554) (← links)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)
- A 4/3 OPT+2/3 approximation for big two-bar charts packing problem (Q6147752) (← links)
- An improved approximation for packing big two-bar charts (Q6187994) (← links)