Improvement in the Herz recursive algorithm for the two-dimensional cutting stock problem

被引:0
|
作者
Hifi, M [1 ]
Zissimopoulos, V [1 ]
机构
[1] UNIV PARIS 11,URA 410 CNRS,LRI,CTR ORSAY,F-91405 ORSAY,FRANCE
来源
关键词
cutting stock problems; knapsack; recursive algorithms; dynamic programming;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The recursive algorithm of Herz is the better actually known algorithm for solving two-dimensional cutting stock problems. We propose some modifications relied on one-dimensional knapsack and dynamic programming principles which improve significantly the computational power of the algorithm.
引用
收藏
页码:111 / 125
页数:15
相关论文
共 50 条