Work

Bottom-Left Placement Theorem for Rectangle Packing

Year: 2011

Type: preprint

Abstract: This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1107.4463

Authors: Huang, Wenqi, Ye, Tao, Chen, Duanbing

Institutions: Huazhong University of Science and Technology, University of Electronic Science and Technology of China

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2165280361

Cites:

Cited by: 2

Related to: 10