{"title":"关于固定收费运输问题","authors":"K. Spielberg","doi":"10.1145/800257.808885","DOIUrl":null,"url":null,"abstract":"The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"70","resultStr":"{\"title\":\"On the fixed charge transportation problem\",\"authors\":\"K. Spielberg\",\"doi\":\"10.1145/800257.808885\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.\",\"PeriodicalId\":167902,\"journal\":{\"name\":\"Proceedings of the 1964 19th ACM national conference\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1964-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"70\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1964 19th ACM national conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800257.808885\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1964 19th ACM national conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800257.808885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 70
摘要
本文主要研究了混合变量技术(由于J. F. Benders)在固定收费运输问题中的应用。由于问题的特殊结构，一般算法中有几个部分可以简化。一般迭代的数学规划部分本质上变成了一个0 - 1整数规划问题。将线性规划部分简化为具有一定禁行路线的运输问题，并对其进行了详细讨论。给出了迭代过程的一个实例。
The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
