Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZGivnK2Y/QwfS8
Repositorysid.inpe.br/mtc-m17@80/2007/06.21.16.46   (restricted access)
Last Update2008:06.05.18.52.24 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m17@80/2007/06.21.16.46.30
Metadata Last Update2018:06.05.03.30.24 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1016/j.cor.2006.10.018
ISSN0305-0548
Citation KeyYanasseKats:2008:EnScGe
TitleAn enumeration scheme to generate constrained exact checkerboard patterns
Year2008
MonthJune
Access Date2024, Apr. 27
Secondary TypePRE PI
Number of Files1
Size225 KiB
2. Context
Author1 Yanasse, Horácio Hideki
2 Katsurayama, Daniel Massaru
Group1 LAC-CTE-INPE-MCT-BR
2 LAC-CTE-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalComputers and Operations Research
Volume35
Number6
Pages2114-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 Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsOperations Research
Mathematics
Computer Science
Exact restricted checkerboard pattern
1-group pattern
Pattern generation
Constructive algorithm
Enumerative algorithm
2-stage guillotine patterns
AbstractCheckerboard 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.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > An enumeration scheme...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filean enumeration.pdf
User Groupadministrator
rosemary
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
5. Allied materials
LinkingTrabalho Vinculado à Tese/Dissertação
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionlcp.inpe.br/ignes/2004/02.12.18.39
cptec.inpe.br/walmeida/2003/04.25.17.12
6. Notes
Empty Fieldsalternatejournal 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 


Close