一种分割算法求解有奖有容位置路由问题

{"title":"一种分割算法求解有奖有容位置路由问题","authors":"Daniel Negrotto, I. Loiseau","doi":"10.1007/s11750-020-00590-x","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":49432,"journal":{"name":"Top","volume":"39 1","pages":"34 - 57"},"PeriodicalIF":1.5000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11750-020-00590-x","citationCount":"1","resultStr":"{\"title\":\"A Branch & Cut algorithm for the prize-collecting capacitated location routing problem\",\"authors\":\"Daniel Negrotto, I. Loiseau\",\"doi\":\"10.1007/s11750-020-00590-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":49432,\"journal\":{\"name\":\"Top\",\"volume\":\"39 1\",\"pages\":\"34 - 57\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2021-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s11750-020-00590-x\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Top\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1007/s11750-020-00590-x\",\"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-020-00590-x","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}