考虑最近欧氏距离的区域客户最小-最大设施选址问题的求解方法

{"title":"考虑最近欧氏距离的区域客户最小-最大设施选址问题的求解方法","authors":"Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural","doi":"10.1007/s10589-019-00163-0","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":508919,"journal":{"name":"Computational Optimization and Applications","volume":"86 6","pages":"537 - 560"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances\",\"authors\":\"Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural\",\"doi\":\"10.1007/s10589-019-00163-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":508919,\"journal\":{\"name\":\"Computational Optimization and Applications\",\"volume\":\"86 6\",\"pages\":\"537 - 560\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Optimization and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s10589-019-00163-0\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Optimization and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10589-019-00163-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}