| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZGivnJVY/Lixvy |
| Repository | sid.inpe.br/mtc-m16@80/2006/05.30.12.55 (restricted access) |
| Last Update | 2006:05.30.12.55.10 (UTC) administrator |
| Metadata Repository | sid.inpe.br/mtc-m16@80/2006/05.30.12.55.12 |
| Metadata Last Update | 2018:06.05.01.28.59 (UTC) administrator |
| Secondary Key | INPE-13765-PRE/8954 |
| ISSN | 0377-2217 |
| Citation Key | LorenaLope:1994:SuHeSe |
| Title | A surrogate heuristic for set covering problems  |
| Project | Otmização combinatório, algorítmos e heurísticas |
| Year | 1994 |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 361 KiB |
| 2. Context | |
| Author | 1 Lorena, Luiz Antonio Nogueira 2 Lopes, Fabio Belo |
| Resume Identifier | 1 8JMKD3MGP5W/3C9JHMQ |
| Group | 1 LAC-INPE-MCT-BR 2 LAC-INPE-MCT-BR |
| Affiliation | 1 Instituto Nacional de Pesquisas Espaciais (INPE) 2 Instituto Nacional de Pesquisas Espaciais (INPE) |
| Journal | European Journal of Operational Research |
| Volume | 79 |
| Pages | 138-150 |
| History (UTC) | 2006-05-30 12:55:12 :: vinicius -> administrator :: 2009-08-12 00:26:15 :: administrator -> vinicius :: 2010-01-29 17:00:12 :: vinicius -> administrator :: 2018-06-05 01:28:59 :: administrator -> marciana :: 1994 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Keywords | set covering optimization surrogate relaxation heuristics |
| Abstract | The purpose of this paper is to present a new heuristic for set covering problems, based upon continuous surrogate relaxations and subgradient optimization. The algorithm combines problem reduction tests, an adequate step size control, and avoid preliminary sorting in solving the continuous surrogate relaxations. Computational tests for large scale set covering problems (up to 1000 rows and 12000 columns) indicate better-quality results than algorithms based on lagrangian relaxations in terms of final solutions and mainly in computer times. Although the solving of a single surrogate optimization problem is slower than a corresponding lagrangian optimization, the overall performance is almost twice as fast. This is due to the smaller number of iterations which is a result of faster convergence and less oscillation. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A surrogate heuristic... |
| 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 | lorena-surrogate.pdf |
| User Group | administrator vinicius |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Archiving Policy | denypublisher denyfinaldraft36 |
| Read Permission | deny from all and allow from 150.163 |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
| Dissemination | WEBSCI; PORTALCAPES. |
| Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
| 6. Notes | |
| Empty Fields | alternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository month nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |