Metadata language
An inexact bundle approach to cutting-stock problems
Subtitle:Raport Badawczy = Research Report ; RB/40/2008
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:52 pages ; 21 cm ; Bibliography p. --0
Subject and Keywords:Programowanie całkowitoliczbowe ; Lagrangian relaxation ; Nondifferentiable convex optimization ; Integer programming ; Bundle methods ; Knapsack problems ; Problem plecakowy ; Cutting-stock ; Optymalizacja wypukła nieróżniczkowalna ; Relaksacja lagrange'a ; Rozkrój materiału
Abstract:The paper presents a bundle method for minimizing the sum of two convex functions, one of them being known only via an oracle of arbitrary accuracy. Each iteration involves solving two subproblems in which the functions are alternately represented by their linearizations. This approach is motivated by applications to nonlinear multicommodity flow problems. Encouraging numerical experience on large scale problems is reported. It is shown that the LP relaxation of the cutting-stock problem can be solved efficiently by the recently proposed inexact bundle method. This method saves work by allowing inaccurate solutions to knapsack subproblems. With suitable rounding heuristics, the proposed method solves almost all the cutting-stock instances from the literature.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use:Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: