Article ID: | iaor19983001 |
Country: | United States |
Volume: | 43 |
Issue: | 10 |
Start Page Number: | 1431 |
End Page Number: | 1436 |
Publication Date: | Oct 1997 |
Journal: | Management Science |
Authors: | Lamar Bruce W., Wallace Chris A. |
Keywords: | programming: transportation, programming: integer |
Conditional penalties are used to obtain lower bounds to subproblems in a branch-and-bound procedure that can be tighter than the LP relaxation of the subproblems. For the fixed charge transportation problem (FCTP), branch-and-bound algorithms have been implemented using conditional penalties proposed by Driebeek, Cabot and Erenguc, and Palekar