@misc{Kiwiel_Krzysztof_An_2008,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2008},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 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.},
 title={An inexact bundle approach to cutting-stock problems},
 type={Text},
 URL={http://rcin.org.pl/Content/144843/PDF/RB-2008-40.pdf},
 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},
}