Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.

Miroslav Chlebík Janka Chlebíková

Published in: CIAC (2006)

Keyphrases

packing problem
bin packing
approximation algorithms
integer programming
cutting stock
line segments
dc programming
hough transform
mixed integer linear program
feature selection
axis parallel
wavelet transform
rotation angles
minimum bounding
maximum profit