FAST ALGORITHMS FOR SINGLE-SINK FIXED CHARGE TRANSPORTATION PROBLEMS WITH APPLICATIONS TO MANUFACTURING AND TRANSPORTATION

The single-sink fixed-charge transportation problem has many applicati ons in the area of Manufacturing and Transportation - These include th e supplier selection problem, the product distribution/fleet selection problem and the process selection problem. lit this paper we investig ate the single-sink fixed-charge transportation, problem. We develop i mplicit enumeration procedures to solve this problem. These procedures include both domination rules and lower bounds. We also show hour the domination rules can be integrated into the lower bounds so as to get even better lower bounds. We test our procedures against the best pre -existing procedure and thereby demonstrate that problems which mere p reviously computationally intractable can nom be easily solved.