Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds

DOI10.1016/J.EJOR.2006.12.052MaRDI QIDQ2456409zbMATH OpenOpenAlexFDO

Authors M. Z. Arslanov, D. U. Ashigaliev, E. E. Ismail

Publication date 18 October 2007

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

Full work available at URL https://doi.org/10.1016/j.ejor.2006.12.052

zbMATH Keywords

shortest path problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• A polynomial algorithm for one problem of guillotine cutting
• scientific article; zbMATH DE number 1264416
• The two-dimensional cutting stock problem revisited
• scientific article; zbMATH DE number 2146649

Cites work

• A Genetic Algorithm for Solving the Container Loading Problem
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• A typology of cutting and packing problems
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Convex Analysis
• Exact solution of the two-dimensional finite bin packing problem
• Finding the convex hull of a simple polygon
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3896667 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3735554 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• On polynomial solvability of two multiprocessor scheduling problems
• Undirected single-source shortest paths with positive integer weights in linear time

Cited in

(11)

• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A polynomial algorithm for one problem of guillotine cutting
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• scientific article; zbMATH DE number 1264416 (Why is no real title available?)
• scientific article; zbMATH DE number 1784423 (Why is no real title available?)
• scientific article; zbMATH DE number 2146649 (Why is no real title available?)
• scientific article; zbMATH DE number 2106794 (Why is no real title available?)
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• Covering with rectangular pieces
• On guillotine cutting sequences
• A fast algorithm for cutting a rectangle into equal rectangular pieces

This page was built for publication: Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds

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