Title: Solving the Linear Programming Relaxation of Cutting and Packing Problems: A Hybrid Simplex Method/Subgradient Optimization Procedure
Authors: Degraeve, Zeger
Peeters, Marc
Issue Date: 2000
Series Title: pages:1-17
Abstract: In this paper we present a new method for solving the linear programming relaxation of the Cutting Stock Problem. The method is based on the relationship between
column generation and Lagrange relaxation. We have called our method the Hybrid Simplex Method/Subgradient Optimization Procedure. We test our procedure on
generated data sets and compare it with the classical column generation approach.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Department of Accountancy, Finance and Insurance (AFI), Leuven - miscellaneous

Files in This Item:
File Description Status SizeFormat
OR_0017.pdf Published 287KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.