An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow

References

• Ackoff , Ruseel.L. and Sasieni , Maurice.W. 1984 . Fundainentals of Operations Research , New Delhi : Wiley Eastern Limited .
   Google Scholar
• Bhatia , H.L. , Swaroop , . , Kanti , . and Puri , M.C. 1976 . Time-cost trade off in atransportation problem . Opsearch , 13 : 129 – 142 .
   Google Scholar
• Hirsch W.M. Dantzig G.B. Notes on linear programming: Part XIX, The fixed charge problem Santa Monica, California 1954 Rand Research, Memorandum No. 1383
   Google Scholar
• Khanna Saroj Bakshi H. C. Arora S. R. Time minimization transportation problem with restricted flow 1983 25 1–2 65 74 Cahiers du C.E.R.O.
   Google Scholar
• Kuhn , H. and Baumol , W. 1962 . An Approximate algorithm for the fixedcharge transportation problem . Nacel Research Logistics Quuterly , 9 : 1 – 15 .
   Google Scholar
• Murty , K.G. 1968 . Solving the fixed charge problem by ranking the extreme points . Operations Research , 16 : 268 – 279 .
   Web of Science ®Google Scholar
• Basu , M. , Pal , B.B. and Kundu , A. 1994 . An algorithm for the optimum timecost trade-off in fixed-charge bi-criterion transportation problem . Optimization , 30 : 53 – 68 .
   Google Scholar
• Sadagopan , S. and Ravindran , A. 1982 . A vertex ranking algorithm for the fixed-charge transportation problem . European Journal of Operational Research , 32 : 96 – 106 .
   Google Scholar
• Sandrock , . and Keith , . 1988 . A simple algorithm for solving small fixed-charge transportation problem . Jourrzal of the Operational Research Society , 39 : 467 – 475 .
   Web of Science ®Google Scholar
• Steinberg , D.I. 1970 . The fixed-charge problem . Naval Research Logistics Quaterly , 17 : 217 – 236 .
   Google Scholar