@misc{Kiwiel_Krzysztof_An_2004,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2004},
 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 allow­ing inaccurate solutions to knapsack subproblems. With suitable rounding heuristics, our 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/139595/PDF/RB-2004-64.pdf},
 keywords={Lagrangian relaxation, Nondifferentiable convex optimization, Integer programming, Bundle methods, Knapsack problems, Cutting-stock},
}