Close

1. Identity statement
Reference TypeJournal Article
Siteplutao.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
IdentifierJ8LNKAN8RW/39RSFH3
Repositorydpi.inpe.br/plutao/2011/06.11.14.44.16   (restricted access)
Last Update2011:12.28.17.00.11 (UTC) administrator
Metadata Repositorydpi.inpe.br/plutao/2011/06.11.14.44.17
Metadata Last Update2018:06.05.00.01.22 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1111/j.1475-3995.2009.00743.x
ISSN0969-6016
Labellattes: 7195702087655314 2 MauriLore:2011:LaDeUn
Citation KeyMauriLore:2011:LaDeUn
TitleLagrangean decompositions for the unconstrained binary quadratic programming problem
ProjectFAPESP[04/11053-9]; CNPq[305225/2006-5]
Year2011
MonthMar.
Access Date2024, May 04
Secondary TypePRE PI
Number of Files1
Size264 KiB
2. Context
Author1 Mauri, Geraldo Regis
2 Lorena, Luiz Antonio Nogueira
Resume Identifier1
2 8JMKD3MGP5W/3C9JHMQ
Group1
2 LAC-CTE-INPE-MCT-BR
Affiliation1 Fed Univ Espirito Santo UFES, Ctr Agrarian Sci, BR-29500000 Alegre, ES, Brazil
2 Instituto Nacional de Pesquisas Espaciais (INPE)
Author e-Mail Address1
2 lorena@lac.inpe.br
e-Mail Addresslorena@lac.inpe.br
JournalInternational Transactions in Operational Research
Volume18
Number2
Pages257-270
Secondary MarkB1_ADMINISTRAÇÃO,_CIÊNCIAS_CONTÁBEIS_E_TURISMO B4_CIÊNCIA_DA_COMPUTAÇÃO B4_ECONOMIA B2_ENGENHARIAS_I B3_ENGENHARIAS_III B4_ENGENHARIAS_IV B3_INTERDISCIPLINAR B4_MATEMÁTICA_/_PROBABILIDADE_E_ESTATÍSTICA
History (UTC)2011-06-11 17:43:48 :: lattes -> marciana :: 2011
2011-12-28 17:00:11 :: marciana -> administrator :: 2011
2018-06-05 00:01:22 :: administrator -> marciana :: 2011
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
Keywordslagrangean relaxation with clusters
Unconstrained binary quadratic programming
AbstractThe unconstrained binary quadratic programming problem (QP) is a classical non-linear problem of optimizing a quadratic objective by a suitable choice of binary decision variables. This paper proposes new Lagrangean decompositions to find bounds for QP. The methods presented treat a mixed binary linear version (LQP) of QP with constraints represented by a graph. This graph is partitioned into clusters of vertices forming a dual problem that is solved by a subgradient algorithm. The subproblems formed by the generated subgraphs are solved by CPLEX. Computational experiments consider a data set formed by several difficult instances with different features. The results show the efficiency of the proposed methods over traditional Lagrangean relaxations and other methods found in the literature.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Lagrangean decompositions for...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
User Groupadministrator
lattes
marciana
Visibilityshown
Archiving Policydenypublisher denyfinaldraft
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
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 nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate session shorttitle sponsor subject targetfile tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marciana
update 


Close