Raport Badawczy = Research Report ; RB/40/2008
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
52 pages ; 21 cm ; Bibliography p. --0
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.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
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: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
19 paź 2021
28 paź 2020
76
https://rcin.org.pl./publication/180429
Nazwa wydania | Data |
---|---|
RB-2008-40 : Kiwiel Krzysztof Czesław : An inexact bundle approach to cutting-stock problems | 19 paź 2021 |
Kiwiel, Krzysztof
Kiwiel, Krzysztof
Kiwiel, Krzysztof Larsson, Torbjörn Lindberg, Per
Kiwiel, Krzysztof Larsson, Torbjörn Lindberg, Per