The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound Code
- 1 June 1976
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 8 (2) , 241-247
- https://doi.org/10.1080/05695557608975073
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Group-Theoretic Structure in the Fixed-Charge Transportation ProblemOperations Research, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Technical Note—Exact Solution of the Fixed-Charge Transportation ProblemOperations Research, 1971
- An approximative algorithm for the fixed charge problemNaval Research Logistics Quarterly, 1969
- The fixed charge problemNaval Research Logistics Quarterly, 1968
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- An approximate solution method for the fixed charge problemNaval Research Logistics Quarterly, 1967
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961