{"title":"中国邮差问题的整数规划建模","authors":"Feng Jun-wen","doi":"10.37922/pijmit.2014.v03i02.004","DOIUrl":null,"url":null,"abstract":"As far as the traditional Chinese Postman Problem(CPP) is concerned,based on the discussions in the undirected and directed graphs respectively,the corresponding integer programming models are proposed,some numerical examples are given to demonstrate the utility of the models.Furthermore,the models are extended to the case with stochastic weights(the corresponding problem is called Stochastic Chinese Postman Problem).Finally,some possible generalizations of the Chinese Postman Problem are discussed briefly.","PeriodicalId":46024,"journal":{"name":"Journal of Statistics & Management Systems","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Integer Programming Modeling for Chinese Postman Problems\",\"authors\":\"Feng Jun-wen\",\"doi\":\"10.37922/pijmit.2014.v03i02.004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As far as the traditional Chinese Postman Problem(CPP) is concerned,based on the discussions in the undirected and directed graphs respectively,the corresponding integer programming models are proposed,some numerical examples are given to demonstrate the utility of the models.Furthermore,the models are extended to the case with stochastic weights(the corresponding problem is called Stochastic Chinese Postman Problem).Finally,some possible generalizations of the Chinese Postman Problem are discussed briefly.\",\"PeriodicalId\":46024,\"journal\":{\"name\":\"Journal of Statistics & Management Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2014-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Statistics & Management Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37922/pijmit.2014.v03i02.004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Statistics & Management Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37922/pijmit.2014.v03i02.004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Integer Programming Modeling for Chinese Postman Problems
As far as the traditional Chinese Postman Problem(CPP) is concerned,based on the discussions in the undirected and directed graphs respectively,the corresponding integer programming models are proposed,some numerical examples are given to demonstrate the utility of the models.Furthermore,the models are extended to the case with stochastic weights(the corresponding problem is called Stochastic Chinese Postman Problem).Finally,some possible generalizations of the Chinese Postman Problem are discussed briefly.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
