haku: @indexterm Integer programming / yhteensä: 355
viite: 8 / 355
| Tekijä: | Johnston, R.E. Sadinlija, E. |
| Otsikko: | A new model for complete solutions to one-dimensional cutting stock problems |
| Lehti: | European Journal of Operational Research
2004 : FEB, VOL. 153:1, p. 176-183 |
| Asiasana: | Cutting-stock problem Integer programming Scheduling |
| Kieli: | eng |
| Tiivistelmä: | The model presented in this paper resolves the non-linearity in the one-dimensional cutting stock problem, between pattern variables and pattern run lengths, by a novel use of 0-1 variables. The model does not require pre-specification of cutting straints and sequence related constraints. The resultant MIP is relatively compact and its application to four problem instances using a commercial MIP package is presented. |
SCIMA