{"title":"求解单路转运问题的一种高效算法","authors":"A. Ali","doi":"10.1002/NAV.3800330411","DOIUrl":null,"url":null,"abstract":"This paper presents a specialized algorithm for the transshipment along a single road problem. The problem is a specially structured network flow problem. For larger problems, the specialized algorithm is in excess of a hundred times faster than the primal simplex method on a graph.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient algorithm for the transshipment along a single road problem\",\"authors\":\"A. Ali\",\"doi\":\"10.1002/NAV.3800330411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a specialized algorithm for the transshipment along a single road problem. The problem is a specially structured network flow problem. For larger problems, the specialized algorithm is in excess of a hundred times faster than the primal simplex method on a graph.\",\"PeriodicalId\":431817,\"journal\":{\"name\":\"Naval Research Logistics Quarterly\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics Quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/NAV.3800330411\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient algorithm for the transshipment along a single road problem
This paper presents a specialized algorithm for the transshipment along a single road problem. The problem is a specially structured network flow problem. For larger problems, the specialized algorithm is in excess of a hundred times faster than the primal simplex method on a graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
