A branch‐and‐bound algorithm for solving fixed charge problems
- 1 December 1981
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (4) , 607-617
- https://doi.org/10.1002/nav.3800280409
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The pure fixed charge transportation problemNaval Research Logistics Quarterly, 1979
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation ProblemManagement Science, 1976
- The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound CodeA I I E Transactions, 1976
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge ProblemOperations Research, 1975
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- The fixed charge problemNaval Research Logistics Quarterly, 1970
- The fixed charge problemNaval Research Logistics Quarterly, 1968
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- An approximate solution method for the fixed charge problemNaval Research Logistics Quarterly, 1967