最大容量代表问题的精确和启发式方法

Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI:10.5753/ETC.2018.3164

I. E. D. Souza, Mauro Roberto Costa da Silva, Welverton R. Silva, Rafael C. S. Schoeury

{"title":"最大容量代表问题的精确和启发式方法","authors":"I. E. D. Souza, Mauro Roberto Costa da Silva, Welverton R. Silva, Rafael C. S. Schoeury","doi":"10.5753/ETC.2018.3164","DOIUrl":null,"url":null,"abstract":"This paper approaches the problem of finding the system of representatives of a family of disjoint sets. To solve this problem, three methods were used: integer programming, branch-and-bound, and the BRKGA metaheuristic. We observed that, in randomly generated instances, the branch-and-bound algorithm was the best exact method but it was surpassed by BRKGA for large instances.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem\",\"authors\":\"I. E. D. Souza, Mauro Roberto Costa da Silva, Welverton R. Silva, Rafael C. S. Schoeury\",\"doi\":\"10.5753/ETC.2018.3164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper approaches the problem of finding the system of representatives of a family of disjoint sets. To solve this problem, three methods were used: integer programming, branch-and-bound, and the BRKGA metaheuristic. We observed that, in randomly generated instances, the branch-and-bound algorithm was the best exact method but it was surpassed by BRKGA for large instances.\",\"PeriodicalId\":315906,\"journal\":{\"name\":\"Anais do Encontro de Teoria da Computação (ETC)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do Encontro de Teoria da Computação (ETC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5753/ETC.2018.3164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do Encontro de Teoria da Computação (ETC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/ETC.2018.3164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了求不相交集合族的代表系统的问题。为了解决这一问题，采用了三种方法:整数规划、分支定界和BRKGA元启发式。我们观察到，在随机生成的实例中，分支定界算法是最精确的方法，但在大型实例中被BRKGA超越。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem

This paper approaches the problem of finding the system of representatives of a family of disjoint sets. To solve this problem, three methods were used: integer programming, branch-and-bound, and the BRKGA metaheuristic. We observed that, in randomly generated instances, the branch-and-bound algorithm was the best exact method but it was surpassed by BRKGA for large instances.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Anais do Encontro de Teoria da Computação (ETC)

自引率

0.00%

发文量