| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZsFDuKxG/DbFD3 |
| Repository | sid.inpe.br/marciana/2004/08.17.11.11 (restricted access) |
| Last Update | 2004:08.17.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/marciana/2004/08.17.11.11.02 |
| Metadata Last Update | 2018:06.05.01.28.42 (UTC) administrator |
| Secondary Key | INPE-11218-PRE/6667 |
| ISBN/ISSN | 0166-218X |
| ISSN | 0166-218X |
| Citation Key | SomaZinoYana:1995:PoScSu |
| Title | A polynomial-approximation scheme for the subset sum problem  |
| Project | Otimização combinatória |
| Year | 1995 |
| Month | Feb. |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 462 KiB |
| 2. Context | |
| Author | 1 Soma, Nei Yoshihiro 2 Zinober, Alan Solon Ivor 3 Yanasse, Horacio Hideki |
| Resume Identifier | 1 2 3 8JMKD3MGP5W/3C9JHCP |
| Group | 1 LAC-INPE-MCT-BR |
| Affiliation | 1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC) 2 Centro Tecnológico Aeroespacial, Instituto Tecnológico Aeroespacial (CTA.ITA) |
| Journal | Discrete Applied Mathematics |
| Volume | 57 |
| Number | 2-3 |
| Pages | 243-253 |
| History (UTC) | 2005-06-28 12:42:42 :: sergio -> administrator :: 2006-09-28 22:36:22 :: administrator -> sergio :: 2008-01-07 12:49:57 :: sergio -> administrator :: 2018-06-05 01:28:42 :: administrator -> marciana :: 1995 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Keywords | COMPUTER SCIENCE Heuristic methods Set theory Polynomials Algorithms COMPUTAÇÃO APLICADA Métodos heurísticos Teoria do conjunto Polinômios Algoritmos |
| Abstract | The subset sum problem is defined as: given a set of n + 1 positive integers, a1, a2, ..., a(n) and b, find a subset of the a(i)'s such that their sum is the closest to b without exceeding the value b. We propose a variation of the well-known polynomial approximation scheme of Martello and Toth for this problem. From a practical point of view the suggested algorithm has a better experimental error behaviour and comparable running time. It is also shown that in the worst theoretical case both algorithms yield the same error. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A polynomial-approximation scheme... |
| 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 | a polynomial.pdf |
| User Group | administrator sergio |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Archiving Policy | denypublisher denyfinaldraft24 |
| 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 nextedition notes 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 | |