Packing squares independently

DOI10.1016/J.TCS.2024.114910MaRDI QIDQ6652453zbMATH OpenFDO

Authors Wei Wu, Hiroki Numaguchi, Nir Halman, Y. Hu, Mutsunori Yagiura

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114910

zbMATH Keywords

complexitydynamic programmingfully polynomial-time approximation schemestrip packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Optimal rectangle packing
• Packing squares with profits
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• An approximation algorithm for square packing.
• Almost square packing

Cites work

• A branch-and-price algorithm for the two-dimensional level strip packing problem
• A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
• A typology of cutting and packing problems
• An improved typology of cutting and packing problems
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Fully polynomial time approximation schemes for stochastic dynamic programs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• Knapsack problems with position-dependent item weights or profits
• Local search algorithms for the rectangle packing problem with general spatial costs
• Models and bounds for two-dimensional level packing problems
• Strongly polynomial FPTASes for monotone dynamic programs
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• Two-dimensional packing problems: a survey

This page was built for publication: Packing squares independently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652453)