零-一最优覆盖问题的神经网络方法

[1991] Proceedings of the 24th Annual Simulation Symposium Pub Date : 1991-04-01 DOI:10.1109/SIMSYM.1991.151480

A. R. Khan, A. Marudarajan, C. A. Goben

{"title":"零-一最优覆盖问题的神经网络方法","authors":"A. R. Khan, A. Marudarajan, C. A. Goben","doi":"10.1109/SIMSYM.1991.151480","DOIUrl":null,"url":null,"abstract":"This paper reports the investigation of the neural network solution to the zero-one optimal covering problem via computer simulation. The key idea used in this exploration is that for every covering problem there exists an equivalent integer linear programming problem which can be solved by modifying the linear programming neural net circuit proposed by Tank and Hopfield. Simulation results indicate that this method works very well.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Neural network approach to zero-one optimal covering problem\",\"authors\":\"A. R. Khan, A. Marudarajan, C. A. Goben\",\"doi\":\"10.1109/SIMSYM.1991.151480\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper reports the investigation of the neural network solution to the zero-one optimal covering problem via computer simulation. The key idea used in this exploration is that for every covering problem there exists an equivalent integer linear programming problem which can be solved by modifying the linear programming neural net circuit proposed by Tank and Hopfield. Simulation results indicate that this method works very well.<<ETX>>\",\"PeriodicalId\":174131,\"journal\":{\"name\":\"[1991] Proceedings of the 24th Annual Simulation Symposium\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 24th Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.1991.151480\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 24th Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1991.151480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文通过计算机仿真研究了零-一最优覆盖问题的神经网络解。本研究使用的关键思想是，对于每一个覆盖问题，都存在一个等效的整数线性规划问题，该问题可以通过修改Tank和Hopfield提出的线性规划神经网络电路来解决。仿真结果表明，该方法效果良好。

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

查看原文本刊更多论文

Neural network approach to zero-one optimal covering problem

This paper reports the investigation of the neural network solution to the zero-one optimal covering problem via computer simulation. The key idea used in this exploration is that for every covering problem there exists an equivalent integer linear programming problem which can be solved by modifying the linear programming neural net circuit proposed by Tank and Hopfield. Simulation results indicate that this method works very well.<>

求助全文

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

来源期刊

[1991] Proceedings of the 24th Annual Simulation Symposium

自引率

0.00%

发文量