2D knapsack: packing squares
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3705908 (Why is no real title available?)
- scientific article; zbMATH DE number 3510069 (Why is no real title available?)
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 910873 (Why is no real title available?)
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Algorithm Theory - SWAT 2004
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Approximation algorithms for orthogonal packing problems for hypercubes
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Mathematical Foundations of Computer Science 2005
- Maximizing the total profit of rectangles packed into a rectangle
- On the two-dimensional knapsack problem
- Online minimization knapsack problem
- Online removable knapsack with limited cuts
- Online removable square packing
- Optimal Resource Augmentations for Online Knapsack
- Stochastic on-line knapsack problems
Cited in
(2)
This page was built for publication: 2D knapsack: packing squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388093)