@misc{Kiwiel_Krzysztof_An_2006,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2006},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={The paper shows 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://www.rcin.org.pl/Content/139718/PDF/RB-2006-54.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},
}