haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 21 / 544
| Tekijä: | Carvalho, J. M. V. de |
| Otsikko: | LP models for bin packing and cutting stock problems |
| Lehti: | European Journal of Operational Research
2002 : SEP, VOL. 141:2, p. 253-273 |
| Asiasana: | LINEAR PROGRAMMING STOCKS MODELS MODEL TESTING |
| Kieli: | eng |
| Tiivistelmä: | The authors of the article review several linear programming (LP) formulations for the one-dimensional cutting stock and bin packing problems, namely, the models of Kantorovich, Gilmore-Gomory, onecut models, as in the Dyckhoff-Stadtler approach, position- indexed models, and a model derived from the vehicle routing literature. The authors of the article analyze some relations between the corresponding LP relaxations, and their relative strengths, and refer how to derive branching schemes that can be used in the exact solution of these problems, using branch-and-price. The paper provides a substantial list of references on this subject. |
SCIMA