| dc.creator | Hernández,Yunay | |
| dc.creator | Beausoleil,Ricardo | |
| dc.date | 2016-12-01 | |
| dc.date.accessioned | 2023-09-25T14:11:20Z | |
| dc.date.available | 2023-09-25T14:11:20Z | |
| dc.identifier | http://www.scielo.sa.cr/scielo.php?script=sci_arttext&pid=S1409-24332016000200445 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8814682 | |
| dc.description | AbstractWe propose a new algorithm using tabu search to deal with biobjective clustering problems. A cluster is a collection of records that are similar to one other and dissimilar to records in other clusters. Clustering has applications in VLSI design, protein-protein interaction networks, data mining and many others areas. Clustering problems have been subject of numerous studies; however, most of the work has focused on single-objective problems. In the context of multiobjective optimization our aim is to find a good approximation to the Pareto front and provide a method to make decisions. As an application problem we present the zoning problem by allowing the optimization of two objectives. | |
| dc.format | text/html | |
| dc.language | en | |
| dc.publisher | Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica. | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.source | Revista de Matemática Teoría y Aplicaciones v.23 n.2 2016 | |
| dc.subject | combinatorial data analysis | |
| dc.subject | clustering | |
| dc.subject | tabu search | |
| dc.subject | multiobjective optimization | |
| dc.title | Clustering problems in a multiobjective framework | |
| dc.type | info:eu-repo/semantics/article | |
