@inproceedings{ce6e196586c5402c8a68ab25e600fa50,
title = "A bidirectional building approach for the 2D guillotine knapsack packing problem",
abstract = "We investigate the 2D guillotine knapsack packing problem, where the objective is to select and pack a set of rectangles into a sheet with fix size and maximize the total profit of packed rectangles. We combine well known two methods namely top-down approach and bottom-up approach into a coherent algorithm to address this problem. Computational experiments on benchmark test sets show that our approach could find optimal solution for almost all the instances with moderate size and outperform all existing approaches for the larger instances. {\textcopyright} 2013 Springer-Verlag.",
keywords = "2D knapsack, block-building, Cutting, guillotine-cut, Packing",
author = "Lijun Wei and Andrew Lim and Wenbin Zhu",
year = "2013",
doi = "10.1007/978-3-642-38577-3_24",
language = "English",
isbn = "9783642385766",
volume = "7906 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "232--241",
booktitle = "Recent Trends in Applied Artificial Intelligence",
address = "Germany",
note = "26th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2013 ; Conference date: 17-06-2013 Through 21-06-2013",
}