Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16d.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP7W/37JUAGE
Repositorysid.inpe.br/mtc-m19@80/2010/06.01.19.41   (restricted access)
Last Update2010:07.14.17.54.36 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m19@80/2010/06.01.19.41.10
Metadata Last Update2018:06.05.04.36.44 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1007/s12351-009-0075-1
ISSN1866-1505
Citation KeyRibeiroMaurLore:2010:LaDeMa
TitleA lagrangean decomposition for the maximum independent set problem applied to map labeling
Year2010
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size647 KiB
2. Context
Author1 Ribeiro, G. M.
2 Mauri, G. R.
3 Lorena, L. Antonio Nogueira
Group1 LAC-CTE-INPE-MCT-BR
Affiliation1 Universidade Federal do Espírito Santo
2 Universidade Federal do Espírito Santo
3 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalOperational Research
VolumeIn press
History (UTC)2010-07-05 14:54:47 :: simone -> marciana :: 2010
2011-09-19 16:16:56 :: marciana -> administrator :: 2010
2018-06-05 04:36:44 :: administrator -> marciana :: 2010
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsLabel placement
Lagrangean decomposition
Lagrangean relaxation
Maximum independent set
AbstractThe Maximum Independent Set (MIS) problem is a well-known problem where the aim is to find the maximum cardinality independent set in an associated graph. Map labeling problems can often be modeled as a MIS problem in a conflict graph, where labels are selected to be placed near graphical features not allowing overlaps (conflicts) between labels or between labels and features. However, the MIS problem is NP-hard and exact techniques present difficulties for solving some instances. Thus, this paper presents a Lagrangean decomposition to solve a map labeling problem, the Point-Feature Label Placement problem. We treated the problem by a conflict graph that is partitioned into small sub-problems and copies of some decision variables are done. These copies are used in the sub-problems constraints and in some constraints to ensure the equality between the original variables and their copies. After these steps, we relax these copy constraints in a Lagrangean way. Using instances proposed in the literature, our approach was able to prove the optimality for all of them, except one, and the results were better than the ones provided by a commercial solver.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A lagrangean decomposition...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filefulltextlorena.pdf
User Groupadministrator
marciana
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft12
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/mtc-m19@80/2009/08.21.17.02.53
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/mtc-m19@80/2009/08.21.17.02
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel e-mailaddress electronicmailaddress format isbn label lineage mark month nextedition notes number orcid pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marciana
update 


Close