A decomposition problem of a natural number for a rectangular cutting-covering model

Authors:
Paul Iacob;Daniela Marinescu;Kinga Kiss-Iakab
Affiliations:
Transilvania University of Brasov, Department of Computer Science, Iuliu Maniu, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Iuliu Maniu, Brasov, Romania;Transilvania University of Brasov, Department of Computer Science, Iuliu Maniu, Brasov, Romania
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 1
Cited 8

A heuristic dynamic programming algorithm for 2D unconstrained guillotine cutting

Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics

A plan of lauding the boxes for a three dimensional bin packing model

WSEAS TRANSACTIONS on SYSTEMS
The generating of the cutting-covering receipts using Euclid's algorithm

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A topological order for a rectangular three dimensional bin packing problem

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
The determination of the guillotine restrictions for a rectangular covering model

ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
An algorithm for the guillotine restrictions verification in a rectangular covering model

WSEAS Transactions on Computers
Identities and inequalities derived from Euclid's algorithm with applications in cutting-covering receipts

MAMECTIS'10 Proceedings of the 12th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern

WSEAS Transactions on Computers
The determination of the guillotine restrictions for a rectangular cutting-stock pattern

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study in this paper a cutting-covering problem, defined by us in [2] and [3], the problem of covering a rectangular support with rectangular pieces cut from a roll. We first prove that the algorithm used in [2] and [3] for the rectangular cutting-covering problem without losses is not optimal. Starting from a decomposition of a natural number in sums of naturals we develop an algorithm for a better solution for the rectangular cutting-covering problem. Some examples and also the estimation of this algorithm's complexity are presented.