An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- 18 May 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 83 (1) , 21-38
- https://doi.org/10.1016/0377-2217(93)e0277-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- Algorithms for Unconstrained Two-Dimensional Guillotine CuttingJournal of the Operational Research Society, 1985
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- The trim-loss and assortment problems: A surveyEuropean Journal of Operational Research, 1980
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Recursive Computational Procedure for Two-dimensional Stock CuttingIBM Journal of Research and Development, 1972
- A Multistage Solution of the Template-Layout ProblemIEEE Transactions on Systems Science and Cybernetics, 1970
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965