Communications - Scientific Letters of the University of Zilina 2012, 14(3):73-77 | DOI: 10.26552/com.C.2012.3.73-77
Applications of Cutting Stock Problem
- 1 Department of Mathematics, Faculty of Humanities, University of Zilina, Slovakia
We present one heuristic solution for the well-known cutting stock problem which was formulated by Kantorovich in 1939. It is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut to given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. The same difficulty persists when only an approximate solution is being sought by linear programming.
Keywords: model, linear programming, cutting stock, optimal solution, lower bound
Published: September 30, 2012 Show citation
References
- GILMORE, P. C., GOMORY, R. E.: A Linear Programming Approach to the Cutting-Stock Problem, Operation research 9, 1961, pp. 849-859.
Go to original source...
- HAESSLER, R. W., SWEENEY, P. E.: Cutting Stock Problem and Solution Procedures, European J. of Operational Research 54, (1991), pp. 141-150.
Go to original source...
- VICAN, J., GOCAL, J., JOST, J.: Fatigue Resistance of Typical Fatigue Prone Riveted Steel Railway Bridge Structural Detail, Communications - Scientific Letters of the University of Zilina, vol. 13, No. 3, 2011, pp. 5-8.
Go to original source...
This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.