An algorithm for the 2D guillotine cutting stock problem

DOI10.1016/0377-2217(93)90196-TzbMath0782.90075MaRDI QIDQ1309924

Mahesh Girkar, Robert Moll, Nassim Hanifi, Bruce MacLeod

Publication date: 3 March 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicscomputational analysistwo-dimensional guillotine cutting stock

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Applying genetic algorithms and neural networks to the container loading problem

Uses Software

• OR-Library

Cites Work

• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Bounds for Two-Dimensional Cutting
• A Linear Programming Approach to the Cutting-Stock Problem
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• An Algorithm for Two-Dimensional Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: An algorithm for the 2D guillotine cutting stock problem