Optimization Online


Integer Solutions to Cutting Stock Problems

L. Fernández (laura.fernandezfern***at***alumnos.unican.es)
L.A. Fernández (lafernandez***at***unican.es)
C. Pola (polac***at***unican.es)

Abstract: We consider two integer linear programming models for the one-dimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy the orders. In particular, we study an approach based on the classical column-generation procedure by Gilmore and Gomory for solving the linear programming (LP) relaxations and an extra column-generation procedure before solving a final integer problem. For our computational tests we use some data sets from the paper industry and some others generated randomly.

Keywords: One-dimension cutting stock, integer solutions, knapsack problem.

Category 1: Applications -- OR and Management Sciences

Citation: Proceedings of the "2nd International Conference on Engineering Optimization (EngOpt 2010)" CR-ROM Paper nº 1105.

Download: [PDF]

Entry Submitted: 10/04/2010
Entry Accepted: 10/04/2010
Entry Last Modified: 10/04/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society