Palekar, Udatta S.; Karwan, Mark H.; Zionts, Stanley A branch-and-bound method for the fixed charge transportation problem. (English) Zbl 0718.90068 Manage. Sci. 36, No. 9, 1092-1105 (1990). This paper develops a stronger conditional penalty for the fixed charge transportation problem (FCTP) and presents a branch-and-bound method to solve the FCTP. Computational testing shows that the use of these penalties leads to significant reductions in enumeration and solution times for difficult problems in the size range tested. Reviewer: Z.Ma (Beijing) Cited in 28 Documents MSC: 90C11 Mixed integer programming 90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) 90-08 Computational methods for problems pertaining to operations research and mathematical programming Keywords:conditional penalty; fixed charge transportation problem; branch-and- bound PDF BibTeX XML Cite \textit{U. S. Palekar} et al., Manage. Sci. 36, No. 9, 1092--1105 (1990; Zbl 0718.90068) Full Text: DOI OpenURL