On guillotine separable packings for the two-dimensional geometric knapsack problem
From MaRDI portal
Cites work
- A (5/3+)-approximation for strip packing
- A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A structural lemma in 2-dimensional packing, and its implications on approximability
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- Algorithms and Computation
- An Algorithm for Two-Dimensional Cutting Problems
- An EDA for the 2D knapsack problem with guillotine constraint
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Approximating geometric knapsack via L-packings
- Approximation and online algorithms for multidimensional bin packing: a survey
- Approximation schemes for covering and packing problems in image processing and VLSI
- Approximation schemes for maximum weight independent set of rectangles
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Breaking the barrier of 2 for the storage allocation problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Cutting glass
- Exact algorithms for the two-dimensional guillotine knapsack
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Faster approximation schemes for the two-dimensional knapsack problem
- scientific article; zbMATH DE number 953063 (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- Improved pseudo-polynomial-time approximation for strip packing
- Mathematical Foundations of Computer Science 2005
- Modeling two-dimensional guillotine cutting problems via integer programming
- Multistage Cutting Stock Problems of Two and More Dimensions
- New Approximability Results for 2-Dimensional Packing Problems
- On guillotine cutting sequences
- On Guillotine Separability of Squares and Rectangles.
- On rectangle packing, maximizing benefits
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- The two-dimensional cutting stock problem revisited
Cited in
(3)
This page was built for publication: On guillotine separable packings for the two-dimensional geometric knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234106)
