| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16b.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZGivnK2Y/Nk5ym |
| Repository | sid.inpe.br/mtc-m17@80/2006/12.01.18.12 (restricted access) |
| Last Update | 2008:06.05.18.55.58 (UTC) administrator |
| Metadata Repository | sid.inpe.br/mtc-m17@80/2006/12.01.18.12.42 |
| Metadata Last Update | 2018:06.05.03.30.21 (UTC) administrator |
| Secondary Key | INPE--PRE/ |
| DOI | 10.1016/j.cor.2006.09.024 |
| ISSN | 0305-0548 |
| Citation Key | RibeiroLore:2008:LaReCl |
| Title | Lagrangean relaxation with clusters for point-feature cartographic label placement problems  |
| Year | 2008 |
| Month | July |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 508 KiB |
| 2. Context | |
| Author | 1 Ribeiro, Glaydston Mattos 2 Lorena, Luiz Antonio Nogueira |
| Resume Identifier | 1 2 8JMKD3MGP5W/3C9JHMQ |
| 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 | 7 |
| Pages | 2129-140 |
| History (UTC) | 2006-12-01 18:13:24 :: simone -> administrator :: 2007-04-03 01:27:59 :: administrator -> simone :: 2008-06-05 18:56:13 :: simone -> administrator :: 2008-06-29 02:32:49 :: administrator -> simone :: 2008-12-15 12:52:44 :: simone -> administrator :: 2012-11-24 01:39:22 :: administrator -> simone :: 2008 2013-02-20 15:19:52 :: simone -> administrator :: 2008 2018-06-05 03:30:21 :: 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 | Lagrangean relaxation Integer programming Label placement |
| Abstract | This paper presents two new mathematical formulations for the point-feature cartographic label placement problem (PFCLP) and a new Lagrangean relaxation with clusters (LagClus) to provide bounds to these formulations. The PFCLP can be represented by a conflict graph and the relaxation divides the graph in small subproblems (clusters) that are easily solved. The edges connecting clusters are relaxed in a Lagrangean way and a subgradient algorithm improves the bounds. The LagClus was successfully applied to a set of instances up to 1000 points providing the best results of those reported in the literature. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Lagrangean relaxation with... |
| 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 | lagrangean relaxation.pdf |
| User Group | administrator 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 rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarytype typeofwork url versiontype |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |