id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
bracis-33585	Fernandes, Eduardo Augusto Militão; Noronha, Thiago Ferreira de; Coco, Amadeu Almeida	Heuristic Solutions for the 2D Bin-Packing Problem with Varied Size	2024		.htm	text/html	5512	215	55	However, when observing the boxplot with the distribution of solution depths, it is evident that, especially in the most challenging sets of instances in Ortmann’s dataset - Nice300i, Nice400i, Nice500i, Path300i, Path400i and Path500i -, the solutions found by the proposed algorithm have depths smaller, less varied and without extreme values than those displayed by the original algorithm. Heuristic Solutions for the 2D Bin-Packing Problem with Varied Size Download book PDF Download book EPUB Eduardo Augusto Militão Fernandes9, Thiago Ferreira de Noronha9 & Amadeu Almeida Coco10  Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 15413)) Included in the following conference series: Brazilian Conference on Intelligent Systems 400 Accesses Abstract This work addresses the 2D Bin-Packing Problem with Varied Size and proposes heuristic solutions for it.	cache/bracis-33585.htm	txt/bracis-33585.txt