1. Identity statement | |
Reference Type | Journal Article |
Site | mtc-m16b.sid.inpe.br |
Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
Identifier | 6qtX3pFwXQZGivnK2Y/QwfS8 |
Repository | sid.inpe.br/mtc-m17@80/2007/06.21.16.46 (restricted access) |
Last Update | 2008:06.05.18.52.24 (UTC) administrator |
Metadata Repository | sid.inpe.br/mtc-m17@80/2007/06.21.16.46.30 |
Metadata Last Update | 2018:06.05.03.30.24 (UTC) administrator |
Secondary Key | INPE--PRE/ |
DOI | 10.1016/j.cor.2006.10.018 |
ISSN | 0305-0548 |
Citation Key | YanasseKats:2008:EnScGe |
Title | An enumeration scheme to generate constrained exact checkerboard patterns |
Year | 2008 |
Month | June |
Access Date | 2024, Apr. 27 |
Secondary Type | PRE PI |
Number of Files | 1 |
Size | 225 KiB |
|
2. Context | |
Author | 1 Yanasse, Horácio Hideki 2 Katsurayama, Daniel Massaru |
Group | 1 LAC-CTE-INPE-MCT-BR 2 LAC-CTE-INPE-MCT-BR |
Affiliation | 1 Instituto Nacional de Pesquisas Espaciais (INPE) 2 Instituto Nacional de Pesquisas Espaciais (INPE) |
Journal | Computers and Operations Research |
Volume | 35 |
Number | 6 |
Pages | 2114-2128 |
History (UTC) | 2007-06-29 19:12:17 :: rosemary -> simone :: 2008-06-18 12:37:22 :: simone -> administrator :: 2008-06-29 02:34:19 :: administrator -> simone :: 2008-12-08 17:27:34 :: simone -> administrator :: 2012-07-13 21:53:34 :: administrator -> simone :: 2008 2013-02-20 15:19:59 :: simone -> administrator :: 2008 2018-06-05 03:30:24 :: administrator -> marciana :: 2008 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Keywords | Operations Research Mathematics Computer Science Exact restricted checkerboard pattern 1-group pattern Pattern generation Constructive algorithm Enumerative algorithm 2-stage guillotine patterns |
Abstract | Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times. |
Area | COMP |
Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > An enumeration scheme... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
Language | en |
Target File | an enumeration.pdf |
User Group | administrator rosemary simone |
Visibility | shown |
Archiving Policy | denypublisher denyfinaldraft36 |
Read Permission | deny from all and allow from 150.163 |
|
5. Allied materials | |
Linking | Trabalho Vinculado à Tese/Dissertação |
Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
Dissemination | WEBSCI; PORTALCAPES. |
Host Collection | lcp.inpe.br/ignes/2004/02.12.18.39 cptec.inpe.br/walmeida/2003/04.25.17.12 |
|
6. Notes | |
Empty Fields | alternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel documentstage e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarytype typeofwork url versiontype |
|
7. Description control | |
e-Mail (login) | marciana |
update | |
|