We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing of n rectangles whose total height is within a factor of(1 + epsilon) of optimal (up to an additive term), and has running time polynomial both in n and in 1/epsilon.
机构:
Univ Sao Paulo, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Paulo, BrazilUniv Sao Paulo, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Paulo, Brazil
Poldi, Kelly Cristina
Arenales, Marcos Nereu
论文数: 0引用数: 0
h-index: 0
机构:
Univ Sao Paulo, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Paulo, BrazilUniv Sao Paulo, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Paulo, Brazil
机构:
Dept. of Stat. and Operations Res., University of Valencia, 46100 BurjassotDept. of Stat. and Operations Res., University of Valencia, 46100 Burjassot
机构:
Guangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaGuangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R China
Cui, Y.
Zhao, X.
论文数: 0引用数: 0
h-index: 0
机构:
Guangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaGuangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R China
Zhao, X.
Yang, Y.
论文数: 0引用数: 0
h-index: 0
机构:
Guangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaGuangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R China
Yang, Y.
Yu, P.
论文数: 0引用数: 0
h-index: 0
机构:
Guangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaGuangxi Normal Univ, Dept Comp Sci, Guilin 541004, Guangxi, Peoples R China