Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles

DOI10.1016/S0377-2217(99)00454-3MaRDI QIDQ1580968zbMATHOpenAlexFDO

Authors M. Z. Arslanov

Publication date 23 November 2000

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

Full work available at URL https://doi.org/10.1016/s0377-2217(99)00454-3

zbMATH Keywords

continued fractionscutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• A fast algorithm for cutting a rectangle into equal rectangular pieces
• scientific article; zbMATH DE number 2146649
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
• Simplest optimal cutting patterns for equal rectangles

Cites work

• scientific article; zbMATH DE number 3840062 (Why is no real title available?)
• scientific article; zbMATH DE number 3501238 (Why is no real title available?)
• A Fast Algorithm for the Two-Variable Integer Programming Problem
• A Genetic Algorithm for Solving the Container Loading Problem
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• Exact solution of the two-dimensional finite bin packing problem
• The G4-Heuristic for the Pallet Loading Problem

Cited in

(15)

• Generating optimal T-shape cutting patterns for circular blanks
• Plenary Lecture 2: Identities and inequalities derived from Euclid's algorithm with applications in cutting-covering receipts
• The pallet loading problem: a review of solution methods and computational experiments
• A polynomial algorithm for one problem of guillotine cutting
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Simplest optimal cutting patterns for equal rectangles
• Golden ratio and symmetric cutting out
• A bi-objective guillotine cutting problem of stamping strips of equal circles
• Dynamic programming algorithms for generating optimal strip layouts
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• A fast algorithm for cutting a rectangle into equal rectangular pieces
• A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Simplest optimal guillotine cutting patterns for strips of identical circles

This page was built for publication: Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580968)