电信网络中最大风险-不相交/最小代价路径对问题的精确词典学方法

{"title":"电信网络中最大风险-不相交/最小代价路径对问题的精确词典学方法","authors":"M. Pascoal, J. Craveirinha, J. Clímaco","doi":"10.1007/s11750-021-00619-9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":49432,"journal":{"name":"Top","volume":"8 1","pages":"405 - 425"},"PeriodicalIF":1.5000,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks\",\"authors\":\"M. Pascoal, J. Craveirinha, J. Clímaco\",\"doi\":\"10.1007/s11750-021-00619-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":49432,\"journal\":{\"name\":\"Top\",\"volume\":\"8 1\",\"pages\":\"405 - 425\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2021-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Top\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1007/s11750-021-00619-9\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Top","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1007/s11750-021-00619-9","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}