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 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- A new lower bound for online strip packing (Q322552) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- A note on the Kenyon-Remila strip-packing algorithm (Q763478) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber (Q2219513) (← links)
- Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Resource augmentation in two-dimensional packing with orthogonal rotations (Q2583714) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- Two for One: Tight Approximation of 2D Bin Packing (Q3183471) (← links)
- A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
