Close

1. Identity statement
Reference TypeJournal Article
Siteplutao.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
IdentifierJ8LNKAN8RW/3D543FT
Repositorydpi.inpe.br/plutao/2012/11.28.18.47.40   (restricted access)
Last Update2013:02.26.12.56.17 (UTC) administrator
Metadata Repositorydpi.inpe.br/plutao/2012/11.28.18.47.41
Metadata Last Update2018:06.05.00.02.12 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1016/j.cie.2012.08.002
ISSN0360-8352
Labellattes: 7195702087655314 2 MoreiradeCarvalhoNogu:2012:NeMoMi
Citation KeyMoreiradeCarvalhoNogu:2012:NeMoMi
TitleNew models for the mirrored traveling tournament problem
ProjectFAPESP (2009/51831-9); CNPq (471837/2008-3), (300692/2009-9).
Year2012
Access Date2024, Apr. 25
Secondary TypePRE PI
Number of Files1
Size399 KiB
2. Context
Author1 Moreira de Carvalho, Marco Antonio
2 Nogueira Lorena, Luiz Antonio
Resume Identifier1
2 8JMKD3MGP5W/3C9JHMQ
Group1
2 LAC-CTE-INPE-MCTI-GOV-BR
Affiliation1 Ouro Preto Federal University
2 Instituto Nacional de Pesquisas Espaciais (INPE)
Author e-Mail Address1 mamc@iceb.ufop.br
2 lorena@lac.inpe.br
e-Mail Addresslorena@lac.inpe.br
JournalComputers and Industrial Engineering
Volume63
Pages1089-1095
History (UTC)2012-11-28 23:06:34 :: lattes -> marciana :: 2012
2013-01-07 15:54:30 :: marciana -> administrator :: 2012
2013-01-20 15:55:28 :: administrator -> banon :: 2012
2013-02-04 17:53:04 :: banon -> marciana :: 2012
2013-02-27 17:49:58 :: marciana -> administrator :: 2012
2018-06-05 00:02:12 :: administrator -> marciana :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
Keywordstraveling tournament problem
sports scheduling
integer programming
AbstractThe Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round-robin timetable problem. The distance traveled by the teams should be minimized in the final timetable, and a new objective is to minimize the longest distance traveled, named MinMaxTTP. It is proposed an integer programming formulation to the mTTP and two models with dynamic constraints to its solution. Both models are based on the detection of independent sets on conflict graphs, whose use has not been reported in the literature about the problem. Real data benchmarks from a baseball tournament are used in the experiments carried out.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > New models for...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languagept
User Groupadministrator
banon
lattes
marciana
Visibilityshown
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationPORTALCAPES
Host Collectiondpi.inpe.br/plutao@80/2008/08.19.15.01
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel format isbn lineage mark mirrorrepository month nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject targetfile tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marciana
update 


Close