Article ID: | iaor1995632 |
Country: | Netherlands |
Volume: | 48 |
Issue: | 3 |
Start Page Number: | 245 |
End Page Number: | 259 |
Publication Date: | Feb 1994 |
Journal: | Discrete Applied Mathematics |
Authors: | Larsson Torbjrn, Gthe-Lundgren Maud |
Keywords: | networks: flow |
The pure fixed charge transportation problem is reformulated into an equivalent set covering problem with, in general, a large number of constraints. Two constraint generation procedures for its solution are suggested; in both of these, new constraints are generated by the solution of ordinary maximum flow problems. In the first procedure, which is an optimizing Benders-type scheme, each set covering problem is solved by a simple heuristic. Upper and lower bounds to the optimal value of the transportation problem are provided throughout the procedure so that it can be terminated at