@techreport{TD:6UNQN6,
	att_abstract={{This paper addresses a constrained two-dimensional (2D) non-guillotine  cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys.  We propose also a new fitness function to drive the optimization. The approach is tested on a set of instances taken from the literature and compared with other approaches. The experimental results validate the quality of the solutions and the effectiveness of the proposed algorithm. }},
	att_authors={mr5626},
	att_categories={},
	att_copyright={{}},
	att_copyright_notice={{}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={cutting , non-guillotine, packing, genetic algorithm, two-dimensional, hybrid heuristic},
	att_techdoc={true},
	att_techdoc_key={TD:6UNQN6},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:6UNQN6_DS1_2010-08-18T16:16:38.720Z.pdf},
	author={Mauricio Resende and José Gonçalves},
	institution={{}},
	month={October},
	title={{A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem}},
	year=2006,
}