通过预测有效无交叉约束提高约束规划中欧氏TSP求解的效率

{"title":"通过预测有效无交叉约束提高约束规划中欧氏TSP求解的效率","authors":"Elena Bellodi, A. Bertagnon, M. Gavanelli, Riccardo Zese","doi":"10.1007/978-3-030-77091-4_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":446359,"journal":{"name":"IPS-RCRA@AI*IA","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving the Efficiency of Euclidean TSP Solving in Constraint Programming by Predicting Effective Nocrossing Constraints\",\"authors\":\"Elena Bellodi, A. Bertagnon, M. Gavanelli, Riccardo Zese\",\"doi\":\"10.1007/978-3-030-77091-4_20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":446359,\"journal\":{\"name\":\"IPS-RCRA@AI*IA\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IPS-RCRA@AI*IA\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-77091-4_20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IPS-RCRA@AI*IA","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-77091-4_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}