Stock cutting to minimize cutting length
Authors:
- J. BhaduryJBJ. Bhadury
- R. ChandrasekaranRCR. Chandrasekaran
- 1 January 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 88 (1) , 69-87
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algebraic optimization: The Fermat-Weber location problemMathematical Programming, 1990
- Minimum area circumscribing PolygonsThe Visual Computer, 1985
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio gamesMathematical Programming, 1984
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area additionComputer Vision, Graphics, and Image Processing, 1983
- A heuristic solution of the rectangular cutting stock problemThe Computer Journal, 1980
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961