大型路网中最短路径的计算

{"title":"大型路网中最短路径的计算","authors":"G. Ertl","doi":"10.1007/BF01545524","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":226673,"journal":{"name":"Operations-Research-Spektrum","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Shortest path calculation in large road networks\",\"authors\":\"G. Ertl\",\"doi\":\"10.1007/BF01545524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":226673,\"journal\":{\"name\":\"Operations-Research-Spektrum\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations-Research-Spektrum\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BF01545524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations-Research-Spektrum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BF01545524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}