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

DOI10.1016/S0377-2217(99)00454-3zbMath0969.90070OpenAlexW2019265863MaRDI QIDQ1580968

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

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

Related Items

Generating optimal T-shape cutting patterns for circular blanks, A simple algorithm for generating optimal equal circle cutting patterns with minimum sections, Simplest optimal cutting patterns for equal rectangles, Simplest optimal guillotine cutting patterns for strips of identical circles, T-shape homogeneous block patterns for the two-dimensional cutting problem, Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds, A polynomial algorithm for one problem of guillotine cutting, A bi-objective guillotine cutting problem of stamping strips of equal circles, Dynamic programming algorithms for the optimal cutting of equal rectangles, Dynamic programming algorithms for generating optimal strip layouts, The pallet loading problem: a review of solution methods and computational experiments, Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors

Cites Work

• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A Fast Algorithm for the Two-Variable Integer Programming Problem
• A Genetic Algorithm for Solving the Container Loading Problem
• The G4-Heuristic for the Pallet Loading Problem
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• Unnamed Item
• Unnamed Item