Stock cutting to minimize cutting length

DOI10.1016/0377-2217(94)00160-XzbMath0913.90228MaRDI QIDQ1266563

K. Appert

Publication date: 7 October 1998

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

zbMATH Keywords

approximation schemecutting sequence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (10)

An approximation algorithm for cutting out convex polygons ⋮ CUTTING OUT POLYGONS WITH A CIRCULAR SAW ⋮ Approximation algorithms for cutting a convex polyhedron out of a sphere ⋮ Cutting a convex polyhedron out of a sphere ⋮ Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere ⋮ MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS ⋮ A PTAS for cutting out polygons with lines ⋮ CUTTING OUT POLYGONS WITH LINES AND RAYS ⋮ Applying genetic algorithms and neural networks to the container loading problem ⋮ Cutting out polygon collections with a saw

Cites Work

• Unnamed Item
• Algebraic optimization: The Fermat-Weber location problem
• Minimum area circumscribing polygons
• A Linear Programming Approach to the Cutting-Stock Problem
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• An Algorithm for Two-Dimensional Cutting Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: Stock cutting to minimize cutting length