Skip to main content
Conference ProceedingsOPEN ACCESS

A hybrid heuristic algorithm for the rectangular packing problem

Lecture Notes in Computer Science (2005) 3514(I) 783-791
DOI: 10.1007/11428831_97
16Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-and-conquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zhang, D., Deng, A., & Kang, Y. (2005). A hybrid heuristic algorithm for the rectangular packing problem. In Lecture Notes in Computer Science (Vol. 3514, pp. 783–791). Springer Verlag. https://doi.org/10.1007/11428831_97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free