{"title":"对称旅行商问题的分支定界算法","authors":"Alexey Nikolaev, M. Batsyn","doi":"10.1007/978-3-319-94667-2_26","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem\",\"authors\":\"Alexey Nikolaev, M. Batsyn\",\"doi\":\"10.1007/978-3-319-94667-2_26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":403593,\"journal\":{\"name\":\"International Workshop on Combinatorial Algorithms\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Combinatorial Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-94667-2_26\",\"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 Workshop on Combinatorial Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-94667-2_26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}