A note on the approximability of cutting stock problems
| dc.contributor.author | Cintra G.F. | |
| dc.contributor.author | Miyazawa F.K. | |
| dc.contributor.author | Wakabayashi Y. | |
| dc.contributor.author | Xavier E.C. | |
| dc.date.accessioned | 2024-03-13T01:38:54Z | |
| dc.date.available | 2024-03-13T01:38:54Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Cutting stock problems and bin packing problems are basically the same problems. They differ essentially on the variability of the input items. In the first, we have a set of items, each item with a given multiplicity; in the second, we have simply a list of items (each of which we may assume to have multiplicity 1). Many approximation algorithms have been designed for packing problems; a natural question is whether some of these algorithms can be extended to cutting stock problems. We define the notion of "well-behaved" algorithms and show that well-behaved approximation algorithms for one, two and higher dimensional bin packing problems can be translated to approximation algorithms for cutting stock problems with the same approximation ratios. © 2006 Elsevier B.V. All rights reserved. | |
| dc.description.firstpage | 1328 | |
| dc.description.issuenumber | 3 | |
| dc.description.lastpage | 1332 | |
| dc.description.volume | 183 | |
| dc.identifier.doi | 10.1016/j.ejor.2005.09.053 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.uri | https://dspace.mackenzie.br/handle/10899/37594 | |
| dc.relation.ispartof | European Journal of Operational Research | |
| dc.rights | Acesso Restrito | |
| dc.subject.otherlanguage | Approximation algorithm | |
| dc.subject.otherlanguage | Bin packing | |
| dc.subject.otherlanguage | Cutting stock | |
| dc.title | A note on the approximability of cutting stock problems | |
| dc.type | Artigo | |
| local.scopus.citations | 7 | |
| local.scopus.eid | 2-s2.0-34447092898 | |
| local.scopus.subject | Bin packing | |
| local.scopus.subject | Bin packing problems | |
| local.scopus.subject | Cutting stock | |
| local.scopus.subject | Cutting stock problems | |
| local.scopus.updated | 2024-05-01 | |
| local.scopus.url | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34447092898&origin=inward |