×

A branch-and-bound method for the fixed charge transportation problem. (English) Zbl 0718.90068

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)

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
PDF BibTeX XML Cite
Full Text: DOI