The Modiied Integer Round-up Property of the One-dimensional Cutting Stock Problem
暂无分享,去创建一个
[1] Martin Fieldhouse. The duality gap in trim problems: not yet solved , 1997 .
[2] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[3] L. Trotter,et al. Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .
[4] Guntram Scheithauer,et al. About the Gap Between the Optimal Values of the Integer and Continuous Relaxation One-Dimensional Cutting Stock Problem , 1992 .
[5] Odile Marcotte. An instance of the cutting stock problem for which the rounding property does not hold , 1986 .
[6] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..
[7] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[8] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[9] G S C H E I T H A U,et al. A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY , 1995 .