Families of non-IRUP instances of the one-dimensional cutting stock problem
- 作者Jürgen Rietz; Guntram Scheithauer; Johannes Terno
- 卷第121卷
- 印刷ISSN0166-218X
- 文件大小164.70KB
- 发表时间2002
- DOI10.1016/s0166-218x(01)00361-4
- 页码229-245
同作者推荐
Constructions of partitioned difference familiesJianxing Yin; Xiuling Shan; Zihong Tian · 2008
On group divisible covering designsKatherine Heinrich; Jianxing Yin · 1999
Cyclic Difference Packing and Covering ArraysJianxing Yin · Designs, Codes and Cryptography · 2005
List decodability at small radiiYeow Meng Chee; Gennian Ge; Lijun Ji; San Ling; Jianxing Yin · 2011
Constructions of almost difference familiesCunsheng Ding; Jianxing Yin · 2008
Some 20-regular and their applicationsJianxing Yin; Xiaoke Yang; Yang Li · 2011
Constructions of difference covering arraysJianxing Yin · 2003
PrefaceFrank E. Bennett; Charles J. Colbourn; Ruizhong Wei; Jianxing Yin · 2004