Pages that link to "Item:Q2757657"
From MaRDI portal
The following pages link to A near-optimal solution to a two-dimensional cutting stock problem (Q2757657):
Displaying 35 items.
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms (Q2905284) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- Two for One: Tight Approximation of 2D Bin Packing (Q3183471) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths (Q3569837) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- (Q3705224) (← links)
- An approach to two-dimensional cutting stock problems (Q3753794) (← links)
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach (Q3804426) (← links)
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems (Q4272900) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- Asymptotically optimal scheduling of random malleable demands in smart grid (Q4634529) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem (Q4834077) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
- On-line algorithms for packing rectangles into several strips (Q5439071) (← links)
- Probabilistic analysis of shelf algorithms for strip packing (Q5491239) (← links)
- Approximate algorithms to pack rectangles into several strips (Q5491240) (← links)
- PACKING SOFT RECTANGLES (Q5493900) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Online strip packing with modifiable boxes (Q5949922) (← 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)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- (Q6167198) (← links)
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes (Q6574943) (← links)