2D Knapsack: Packing Squares

DOI10.1007/978-3-642-21204-8_21zbMath1329.90118OpenAlexW3022701806MaRDI QIDQ3004667

György Dósa, Chenyang Zhou, Xin Han, Attila Benko, Min Chen

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_21

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing the total profit of rectangles packed into a rectangle
• Online removable square packing
• Approximation algorithms for orthogonal packing problems for hypercubes
• On the two-dimensional knapsack problem
• Stochastic on-line knapsack problems
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Online Minimization Knapsack Problem
• Optimal Resource Augmentations for Online Knapsack
• Online Knapsack Problems with Limited Cuts
• 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