最大团问题与整数规划模型及其修正、复杂性与实现

IF 2.2 3区 综合性期刊 Q2 MULTIDISCIPLINARY SCIENCES Symmetry-Basel Pub Date : 2023-10-26 DOI:10.3390/sym15111979
Milos Seda
{"title":"最大团问题与整数规划模型及其修正、复杂性与实现","authors":"Milos Seda","doi":"10.3390/sym15111979","DOIUrl":null,"url":null,"abstract":"The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation\",\"authors\":\"Milos Seda\",\"doi\":\"10.3390/sym15111979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.\",\"PeriodicalId\":48874,\"journal\":{\"name\":\"Symmetry-Basel\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2023-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symmetry-Basel\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/sym15111979\",\"RegionNum\":3,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symmetry-Basel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/sym15111979","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

最大团问题是最优化及相关图论问题中形式多样的问题,具有广泛的应用。由于它的np完备性(不确定多项式时间),问题出现在更大的实例的可解性。与基于近似或随机启发式方法的传统方法不同,我们将重点放在GAMS(通用代数建模系统)环境中整数规划模型的使用上,该模型基于精确方法和复杂的确定性启发式。我们提出了整数模型的修正,推导了它们的时间复杂度,并展示了它们在GAMS中的直接应用。GAMS可以在几分钟内为具有数百个顶点和数千条边的实例找到最大团问题的最优解。对于非常大的实例,在合理的时间内给出最优的良好近似值。与上述所有算法相比,这种方法的一大优点是,即使GAMS没有在选定的时间限制内找到最知名的解决方案,它也会在计算结束时将其值显示为可到达的边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Symmetry-Basel
Symmetry-Basel MULTIDISCIPLINARY SCIENCES-
CiteScore
5.40
自引率
11.10%
发文量
2276
审稿时长
14.88 days
期刊介绍: Symmetry (ISSN 2073-8994), an international and interdisciplinary scientific journal, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish their experimental and theoretical research in as much detail as possible. There is no restriction on the length of the papers. Full experimental and/or methodical details must be provided, so that results can be reproduced.
期刊最新文献
The Chromatic Entropy of Linear Supertrees and Its Application Angular-Momentum Modes in a Bosonic Condensate Trapped in the Inverse-Square Potential Development of Compact Bandpass Filter Using Symmetrical Metamaterial Structures for GPS, ISM, Wi-MAX, and WLAN Applications Entanglement and Symmetry Structure of N(= 3) Quantum Oscillators with Disparate Coupling Strengths in a Common Quantum Field Bath Nuclear Shape-Phase Transitions and the Sextic Oscillator
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1