Pages that link to "Item:Q878442"
From MaRDI portal
The following pages link to Maximizing the total profit of rectangles packed into a rectangle (Q878442):
Displaying 28 items.
- Packing anchored rectangles (Q276437) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- Online square-into-square packing (Q521815) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- On packing rectangles with resource augmentation: maximizing the profit (Q2867317) (← links)
- Packing squares with profits (Q2902901) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Two for One: Tight Approximation of 2D Bin Packing (Q3183471) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
- Algorithm Theory - SWAT 2004 (Q5315388) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- Efficient approximation algorithms for scheduling moldable tasks (Q6113310) (← links)
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)