搜索通信网络中最短的边不相交路径对。模糊方法

{"title":"搜索通信网络中最短的边不相交路径对。模糊方法","authors":"Lissette Valdés, A. Ariza, S. Allende, G. Joya","doi":"10.1007/978-3-030-20518-8_53","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":103356,"journal":{"name":"International Work-Conference on Artificial and Natural Neural Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach\",\"authors\":\"Lissette Valdés, A. Ariza, S. Allende, G. Joya\",\"doi\":\"10.1007/978-3-030-20518-8_53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":103356,\"journal\":{\"name\":\"International Work-Conference on Artificial and Natural Neural Networks\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Work-Conference on Artificial and Natural Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-20518-8_53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Work-Conference on Artificial and Natural Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-20518-8_53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}